UVA 10474 - Where is the Marble?

#include <iostream>
#include <algorithm>
using namespace std;
int n, q, a[100005], cnt=1, b, flag;
int main()
{
while (scanf("%d%d", &n, &q)!=EOF && n+q){
for (int i=0; i<n; i++)
scanf("%d", &a[i]);
sort(a, a+n);
printf("CASE# %d:\n", cnt++);
for (int i=0; i<q; i++){
scanf("%d", &b);
flag = 0;
for (int j=0; j<n; j++)
if (a[j] == b){
flag = j + 1;
break;
}
if (flag)
printf("%d found at %d\n", b, flag);
else
printf("%d not found\n", b);
}	 
}
return 0;
 }