随便打打

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=10000;
int main()
{
    int n,q;
    int a[maxn];
    int k=0;
    int as[k];
    while(cin>>n>>q)
    {
        k++;
        cout<<"CASE# "<<k<<":"<<endl;
        int i;
        for(i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);

        while(q--)
        {
            int x;
            cin>>x;
            int p=lower_bound(a,a+n,x)-a;
            if(a[p]==x)
                cout<<x<<" found at "<<p+1<<endl;
            else
                cout<<x<<" not found"<<endl;

        }

    }
}