HDU - 2141 Can you find it?

Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X. 

Input There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<= S<=1000. all the integers are 32-integers. 
Output For each case, firstly you have to print the case number as the form "Case d:", then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print "YES", otherwise print " NO". 
Sample Input

3 3 3 
1 2 3 
1 2 3 
1 2 3 
3 
1 
4 
10

Sample Output

Case 1: 
NO 
YES 
NO

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 505;
int a[maxn];
int b[maxn];
int c[maxn];
int d[maxn*maxn];
int main()
{
 int l,m,n,i,j,s,Count=0,cnt;
 while(cin >> l >> m >> n)
 {
     for (i = 0; i < l; i++) cin >> a[i];
     for (i = 0; i < m; i++) cin >> b[i];
     for (i = 0; i < n; i++) cin >> c[i];
     for (i = 0; i < l; i++)
      cnt = 0; 
	  for (i = 0; i< l;i++) 
       for(j =0; j < m; j++)
        {
         d[cnt++] = a[i] + b[j];
        }
     sort (d,d+cnt);
     printf("Case %d:\n",++Count);
        cin >> s;
        while (s--)
        {
            int x;
            cin >> x;
			 bool flag = false;
            for (i = 0; i < n;i++)
            {
                int key = x -c[i];
                int l = 0,r = cnt - 1,mid;
                while(l <= r)
                {
                    mid = (l + r) / 2;
                    if(d[mid] > key) r = mid - 1;
                     else if(d[mid] < key) l = mid + 1;
                       else {
                        flag = true;
                        break;
                       } 
                }
                if(flag) break;
            }
            if(flag) cout <<"YES"<<endl;
            else cout << "NO"<<endl;
        }
            
 }


}