Where is the Marble? （algorithm）

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
int main()
{
    //freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false);
    int n,q,cnt = 1,te;
    vector<int> A;
    vector<int> :: iterator it;
    while(cin >> n >> q && n && q)
    {
        A.clear();
        cout << "CASE# " << cnt++ << ":" << endl;
        for(int i=0;i<n;i++) {cin >> te;A.push_back(te);}
        sort(A.begin(),A.end());
        for(int i=0;i<q;i++)
        {
            cin >> te;
            it = find(A.begin(),A.end(),te);
            if(it == A.end()) cout << te << " not found" << endl;
            else
            {
                for(int j=0;j<A.size();j++)
                if(A[j] == te) {cout << te << " found at " << j+1 << endl;break;}
            }
        }


    }

    return 0;
}