Where is the Marble? UVA - 10474

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<iomanip>
#define ll long long

using namespace std;

const int maxn = 1e5+7;
int n,q;
struct stu{
int k;
int v;
} a[maxn];

bool cmp(struct stu &a, struct stu &b) {
return a.v < b.v;
}
int main(){
int kase = 0;
while(1) {
scanf("%d%d",&n,&q);
if(n == 0&&q == 0) break;
for(int i = 0; i < n; i++) a[i].k = i;
for(int i = 0; i < n; i++) scanf("%d",&a[i].v);
sort(a,a+n,cmp);
printf("CASE# %d:\n",++kase);
int c;
for(int i = 0; i < q; i++) {
scanf("%d",&c);
int ke = -1;
for(int i = 0; i < n; i++)
if(c == a[i].v) {
ke = i+1;
break;
} else if(c < a[i].v) break;
if(ke == -1) printf("%d not found\n",c);
else printf("%d found at %d\n",c,ke);
}

}
return 0;
}