水题，一开始不会，照例题敲，然后刚才又自己写了一遍，感觉就是不一样- -



#include<cstdio>
#include<algorithm>
#define MAXN 10000
using namespace std;

int marble[MAXN];

int main() {
    int x, n, q, kase = 0;
    while(scanf("%d%d", &n, &q) == 2 && n) {
        for(int i = 0; i < n; i++)
            scanf("%d", &marble[i]);
        sort(marble, marble + n);
        printf("CASE# %d:\n", ++kase);
        while(q--){
            scanf("%d", &x);
            int p = lower_bound(marble, marble + n, x) - marble;
            if(marble[p] == x) printf("%d found at %d\n", x, p + 1);
            else printf("%d not found\n", x);
        }
    }
    return 0;
}