#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<vector>

 #include<algorithm>

 #include<cmath>

 using namespace std;

 const int maxn = ;

 int l,n,m;

 int a[maxn];

 int b[maxn];

 int c[maxn];

 int sum[maxn];

 int cnt = ;

 int find(int x){

     for(int i = ; i <= m; i ++){

         int l = ,r = cnt+;

         int mid;

         while( l <= r){

             mid = ( l + r) >> ;

             if(c[i] + sum[mid] == x){

                 return true;

             }

             else if(c[i] + sum[mid] < x){

                 l = mid + ;

             }

             else if(c[i] + sum[mid] > x){

                 r = mid - ;

             }

         }

     }

     return false;

 } 

 int main(){

     cin>>l>>n>>m;

     for(int i = ; i <= l ;i++){

         cin>>a[i];

     }

     for(int i = ; i <= n ;i++){

         cin>>b[i];

     }

     for(int i = ; i <= m ;i++){

         cin>>c[i];

     }

     for(int i = ; i <= l ;i++){

         for(int j = ; j <= n ;j++){

             sum[cnt++] = a[i]+b[j];

         }

     }

     sort(sum+,sum++n);

     int s;

     cin>>s;

     while(s--){

         int x;

         cin>>x;

         if(find(x)){

             cout<<"Yes"<<endl;

         }

         else{

             cout<<"No"<<endl;

         }

     }

     return ;

 }