você é linda!

#include <bits/stdc++.h>
using namespace std;

int n, q;

int main(){
    int t = 0;
    while(scanf("%d %d", &n, &q) && n != 0){

        cout << "CASE# " << ++t << ":\n";
        vector<int> v;
        for(int i = 0; i < n ; i++){
            int aux;
            scanf("%d", &aux);
            v.push_back(aux);
        }
        sort(v.begin(), v.end());
        for(int i = 0; i < q; i++){
            int aux;
            scanf("%d", &aux);
            int k = lower_bound(v.begin(), v.end(), aux) - v.begin();
            if(v[k] == aux){
                printf("%d found at %d\n", aux, k+1);
            } else {
                printf("%d not found\n", aux);
            }
        }
    }
    return 0;
}