#include<cstdio>

#include<algorithm>

using namespace std;

const int maxn = ;

int main() {

    int n,q,x,a[maxn],kase=;

    while(scanf("%d%d",&n,&q)==&&n){

        printf("CASE# %d:\n",++kase);

        for(int i=;i<n;i++) scanf("%d",&a[i]);

        sort(a,a+n);//排序

        while(q--){

            scanf("%d",&x);

            int p=lower_bound(a,a+n,x)-a;//在已排序数组a中寻找x

            if(a[p]==x) printf("%d found at %d\n",x,p+);

            else printf("%d not found\n",x);

        }

    }

    return ;

}