#include<iostream>

 #include<vector>

 #include<queue>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<set>

 using namespace std;

 typedef pair<int, int> Pair;

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 int T, n, m1, m2, m3, cases;

 ll a[], b[], c[];

 ll cnt[];

 int tot;

 bool Find(ll x)

 {

     int l = , r = tot-;

     while(l <= r)

     {

         int mid = (l + r) / ;

         if(cnt[mid] == x)return true;

         else if(cnt[mid] < x)l = mid + ;

         else r = mid - ;

     }

     return false;

 }

 int main()

 {

     while(scanf("%d%d%d", &m1, &m2, &m3) != EOF)

     {

         memset(cnt, , sizeof(cnt));

         tot = ;

         for(int i = ; i < m1; i++)cin >> a[i];

         for(int i = ; i < m2; i++)cin >> b[i];

         for(int i = ; i < m3; i++)cin >> c[i];

         for(int i = ; i < m1; i++)

             for(int j = ; j < m2; j++)cnt[tot++] = (a[i] + b[j]);

         sort(cnt, cnt + tot);

         sort(c, c + m3);

         scanf("%d", &n);

         printf("Case %d:\n", ++cases);

         while(n--)

         {

             ll x;

             cin >> x;

             bool flag = ;

             for(int i = ; i < m3; i++)

             {

                 if(Find(x - c[i]))

                 {

                     flag = ;

                     break;

                 }

             }

             if(flag){printf("YES\n");continue;}

             printf("NO\n");

         }

     }

 }