uva10474

#include<iostream>
#include<algorithm>
using namespace std;
int mm[10001];
int nn[10001];
int main()
{
    int m,n,i,pos,cas=1;
    while(cin>>m>>n&&m!=0&&n!=0)
    {
        for(i=0;i<m;i++)
        {
            cin>>mm[i];
        }
        for(i=0;i<n;i++)
        {
            cin>>nn[i];
        }
         cout<<"CASE# "<<cas<<':'<<endl;
         sort(mm,mm+m);
         for(i=0;i<n;i++)
        {
            pos=lower_bound(mm,mm+m,nn[i])-mm;
            if(mm[pos]==nn[i])
            {
               pos++;
               cout<<nn[i]<<" found at "<<pos<<endl;
            }
            else
            {
                cout<<nn[i]<<" not found"<<endl;
            }
        }
        cas++;
    }
    return 0;
}