
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=10000;
int main()
{
int i,j;
int ccase=0;
int a[maxn];
while(scanf("%d%d",&i,&j)==2&&i)
{
printf("CASE# %d:\n",++ccase);
for(int x=0;x<i;x++)
{cin>>a[x];}
sort(a,a+i);
while(j--)
{
int k;
cin>>k;
int m=lower_bound(a,a+i,k)-a;
if(a[m]==k)
{printf("%d found at %d\n",k,m+1);}
else
printf("%d not found\n",k);
}
}
return 0;
}


