marble RTE

#include<bits/stdc++.h>
using namespace std;
bool comp(int a,int b){
    return a<=b;
}
int n,i,arr[1<<14],m,c=1,q,ind[1<<14];
bool ok[1<<14];
bool visit[1<<14];
int main()
{
    while(cin>>n>>m&&n!=0&&m!=0){
        if(n>10000)return 0;
        memset(ok,0,sizeof(ok)),memset(visit,0,sizeof(visit));
        for(i=1; i<=n; i++){
            cin>>arr[i];
            if(arr[i]>10000||arr[i]<0)return 0;//ERR
            ok[arr[i]]=1;
        }
        sort(arr+1,arr+n+1,comp);
        for(i=1; i<=n; i++){
            if(arr[i]>10000||arr[i]<0)return 0;//ERR
            if(!visit[arr[i]])ind[arr[i]]=i;
            visit[arr[i]]=1;
        }
        printf("CASE# %d:",c++);
        while(m--){
            cin>>q;
            if(q>10000||q<0)return 0;//ERR
            if(ok[q]==1)printf("%d found at %d\n",q,ind[q]);
            else printf("%d not found\n",q);
        }
    }
    return 0;
}