UVA - 10474 Where is the Marble?

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;
#define maxn 100005
int m,n;
int data[maxn];
int main()
{
int num = 1;
while(~scanf("%d%d",&m,&n) && m+n)
{
for(int i = 0; i < m; i++)
{
scanf("%d",&data[i]);
}
sort(data,data+m);
printf("CASE# %d:\n",num++);
while(n--)
{
int k;
scanf("%d",&k);
int ans = -1;
for(int i = 0; i < m ; i++)
if(data[i] == k)
{
ans = i; break;
}
ans == -1?printf("%d not found\n",k) : printf("%d found at %d\n",k,ans+1);
}
}
return 0;
}