UVA - 10474 Where is the Marble?

</pre><pre name="code" class="cpp">

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 10001
using namespace std;

int  cmp(const void *x,const void *y) {
	return *(int *)x - *(int *)y;
}

int n,m,t;
int a[N];
int flag,cou = 0;
int main () {
	while (scanf("%d%d",&n,&m) != EOF) {
		if (n == 0 && m ==0)
			break;
		printf("CASE# %d:\n",++cou);
		memset(a,0,sizeof(a));
		for (int i = 0;i < n; i++) {
			scanf("%d",&a[i]);
			//	printf("%d  ",a[i]);
		}
		qsort(a,n,sizeof(int),cmp);
//		for (int i = 0; i < n; i++)
//			printf("%d",a[i]);
		while (m--)  {
			scanf("%d",&t);
			int ok = 0;
			for (int i = 0; i < n;i++){
				if ( t == a[i]) {
					flag = i;
					ok = 1;
					break;
				}
			}

			if (!ok)
				printf("%d not found\n",t);
			else
				printf("%d found at %d\n",t,flag +1);
		}

	}

	return 0;

}