hzau training 20170121 b

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[505],b[505],c[505];
int ab[505*505];
int la,lb,lc;
int times,temp;
bool judge_num(int l,int r,int x)
{
    int mid;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(mid==x)
        {
            return true;
        }
        if(mid>x)
        {
            l=mid-1;
        }
        else
        {
            r=mid+1;
        }
    }
    return false;
}
void get_ans(int x)
{
    int k;
    for(k=0;k<lc;k++)
    {
        temp=x-c[k];
    }
    if(judge_num(0,la*lb-1,temp))
    {
        cout<<"YES"<<endl;
    }
    else
    {
        cout<<"NO"<<endl;
    }
}
int main()
{
    int i,j,k,num,flag=1;
    while(cin>>la>>lb>>lc);
    {
        for(i=0;i<la;i++)
            cin>>a[i];
        for(j=0;j<lb;j++)
           cin>>b[j];
        for(k=0;k<lc;k++)
            cin>>c[k];
        k=0;
        for(i=0;i<la;i++)
        for(j=0;j<lb;j++)
        {
            ab[k]=a[i]+b[j];
            k++;
        }
        sort(ab,ab+k);
        sort(c,c+lc);
        cin>>times;
        printf("Case %d:\n", flag);
        while(times)
        {
            scanf("%d",&num);
            get_ans(num);
            times--;
        }
        flag++;
    }
    return 0;
}