UVA - 10474

//vector distance() lower_bound()
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<deque>
using namespace std;
vector<int> vect1,vect2;
int main(){
    int T,Q,a,cnt=0;
    while(cin>>T>>Q&&T){
        printf("CASE# %d:\n",++cnt);
        vect1.clear();
        vect2.clear();
        for(int i=0;i<T;i++){
            cin>>a;
            vect1.push_back(a);
        }
        for(int i=0;i<Q;i++){
            cin>>a;
            vect2.push_back(a);
        }
        sort(vect1.begin(),vect1.end());
        for(int i=0;i<Q;i++){
            vector<int>::iterator iter=lower_bound(vect1.begin(),vect1.end(),vect2[i]);
            if(iter==vect1.end()||*iter!=vect2[i])
                printf("%d not found\n",vect2[i]);
            else
                printf("%d found at %d\n",vect2[i],distance(vect1.begin(),iter)+1);
        }
    }
}