#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <bitset>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef std::vector<int> vi;
typedef std::vector<pair<int, int> > vii;
#define FOR(l) for(vi::iterator it=l.begin();it!=l.end();it++)
#define FOR_L(l, s, e) for(vi::iterator it=l.begin()+s;it!=l.end()-e;it++)
 
//----------Main source code -----------------//
int main() {
	int n, q, t, ca=1, pos;
	vi::iterator i;
	while(cin>>n>>q&&n&&q){
		vi l;
		while(n--) cin>>t, l.push_back(t);
		sort(l.begin(), l.end());
		printf("CASE# %d:\n",ca++);
		while(q--){
			cin>>t;
			i=lower_bound(l.begin(),l.end(), t);
			pos=i-l.begin();
			if(i == l.end() || *i!=t) printf("%d not found", t);
			else printf("%d found at %d",t, pos+1);
			cout<<endl;
		}
	}
	return 0;
 
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8Yml0c2V0PgojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPG1hdGguaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBzdGQ6OnZlY3RvcjxpbnQ+IHZpOwp0eXBlZGVmIHN0ZDo6dmVjdG9yPHBhaXI8aW50LCBpbnQ+ID4gdmlpOwojZGVmaW5lIEZPUihsKSBmb3Iodmk6Oml0ZXJhdG9yIGl0PWwuYmVnaW4oKTtpdCE9bC5lbmQoKTtpdCsrKQojZGVmaW5lIEZPUl9MKGwsIHMsIGUpIGZvcih2aTo6aXRlcmF0b3IgaXQ9bC5iZWdpbigpK3M7aXQhPWwuZW5kKCktZTtpdCsrKQoKLy8tLS0tLS0tLS0tTWFpbiBzb3VyY2UgY29kZSAtLS0tLS0tLS0tLS0tLS0tLS8vCmludCBtYWluKCkgewoJaW50IG4sIHEsIHQsIGNhPTEsIHBvczsKCXZpOjppdGVyYXRvciBpOwoJd2hpbGUoY2luPj5uPj5xJiZuJiZxKXsKCQl2aSBsOwoJCXdoaWxlKG4tLSkgY2luPj50LCBsLnB1c2hfYmFjayh0KTsKCQlzb3J0KGwuYmVnaW4oKSwgbC5lbmQoKSk7CgkJcHJpbnRmKCJDQVNFIyAlZDpcbiIsY2ErKyk7CgkJd2hpbGUocS0tKXsKCQkJY2luPj50OwoJCQlpPWxvd2VyX2JvdW5kKGwuYmVnaW4oKSxsLmVuZCgpLCB0KTsKCQkJcG9zPWktbC5iZWdpbigpOwoJCQlpZihpID09IGwuZW5kKCkgfHwgKmkhPXQpIHByaW50ZigiJWQgbm90IGZvdW5kIiwgdCk7CgkJCWVsc2UgcHJpbnRmKCIlZCBmb3VuZCBhdCAlZCIsdCwgcG9zKzEpOwoJCQljb3V0PDxlbmRsOwoJCX0KCX0KCXJldHVybiAwOwoJCn0=

NCAxCjIKMwo1CjEKNQo1IDIKMQozCjMKMwoxCjIKMwowIDA=

4 1
2
3
5
1
5
5 2
1
3
3
3
1
2
3
0 0