#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1e5+8;
int n,q,t,a[MAXN];
int l,r,mid;
int main(){
	for(int k=1; ;k++){
		scanf("%d%d",&n,&q);
		if(n==0&&q==0){
			break;
		}
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		sort(a+1,a+n+1);
		printf("CASE# %d:\n",k);
		for(int i=1;i<=q;i++){
			scanf("%d",&t);
			bool flag=false;
			l=1,r=n;
			int ans=0;
			while(l<=r){
				mid=(l+r)/2;
				if(a[mid]==t){
					flag=true;
					ans=mid;
					break;
				}
				if(a[mid]<=t){
					l=mid+1;
				}else{
					r=mid-1;
				}
			}
			if(flag==false){
				printf("%d not found\n",t);
			}else{
				printf("%d found at %d\n",t,ans);
			}
		}
	}
	return 0;
}