Contest 5_E

#include<bits/stdc++.h>

using namespace std;
int a[1000000];


int main()
{
  //  freopen("In.txt", "r", stdin);
  //  freopen("Out.txt", "w", stdout);

    int n, q;
    int t=1;
    int que;
    int idx;
    int i,j,k;
    for(;;){
        scanf("%d%d", &n,&q);
        if(n==0 && q==0)
            break;
        for(i=0;i<n;i++)
            scanf("%d", &a[i]);

        printf("CASE# %d:\n", t++);
        stable_sort(a,a+n);

        for(j=1;j<=q;j++){
            scanf("%d", &que);
            int flag=0;
                int l=0, h=n-1, mid;

                while(l<=h){
                    mid=(l+h)/2;
                    if(a[mid]==que){
                        idx=mid;
                        h=mid-1;
                        flag=1;
                    }
                    else if(a[mid]<que){
                        l=mid+1;
                    }
                    else{
                        h=mid-1;
                    }
                }
            if(flag==0)
                printf("%d not found\n", que);
            else
                printf("%d fount at %d\n", que,idx+1);
        }
    }
    return 0;
}