#include <bits/stdc++.h>
using namespace std;typedef long long ll;const int N=1e6+12;ll A[128],B[128],C[128],D[N],D_cnt=0; 
int main(){ll n,m,l,q;cin>>n;for(int i=1;i<=n;i++){cin>>A[i];} cin>>m;for(int i=1;i<=m;i++){cin>>B[i];} cin>>l;for(int i=1;i<=l;i++){cin>>C[i];} for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){for(int k=1;k<=l;k++){D[++D_cnt]=A[i]+B[j]+C[k];}}}cin>>q;sort(D+1,D+D_cnt+1);while(q--){int x;cin>>x;if(D[lower_bound(D+1,D+D_cnt+1,x)-D]==x){cout<<"yes"<<endl;}else {cout<<"no"<<endl;}}return 0;}