#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,q,i,j,k,a[100000],b,t=0,c;
    while(1)
    {
        scanf("%d %d",&n,&q);
        if(n==0 && q==0)
            break;
            cout<<"CASE# "<<++t<<":"<<endl;
        for(i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        for(i=0;i<q;i++)
        {
            cin>>b;
            c=lower_bound(a,a+n,b)-a;
            if(a[c]==b)
                cout<<b<<" found at "<<++c<<endl;
            else
                cout<<b<<" not found"<<endl;
        }

    }
    return 0;
}