#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 10000;
int main()
{
int num[maxn];
int n,m,number;
int t = 0;
while(scanf("%d%d",&n,&m),n!=0||m!=0)
{
printf("CASE# %d:\n",++t);
for(int i = 0; i < n; i ++)
scanf("%d",&num[i]);
sort(num,num+n);
for(int i = 0; i < m; i ++)
{
scanf("%d",&number);
int position = lower_bound(num,num+n,number)-num;//要得到具体数值,用地址相减
if(num[position] == number)
printf("%d found at %d\n",number,position+1);
else
printf("%d not found\n",number);
}
}
return 0;
}