#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,q;
    while(scanf("%d%d",&n,&q))
    {
        if(!n)
        {
            return 0;
        }
        static int qrn=1;
        printf("CASE# %d:\n",qrn++);
        int arr[n];
        for(int i=0;i<n;i++)
        {
            scanf("%d",&arr[i]);
        }
        sort(arr,arr+n);
        for(int i=0;i<q;i++)
        {
            int key;
            scanf("%d",&key);
            int vl=(lower_bound(arr,arr+9,key))-arr;
            if(arr[vl]==key)
            {
               printf("%d found at %d\n",key,vl+1);
            }
            else {
                printf("%d not found\n",key);
            }

        }
        n--;
    }
}