样例可过

#include <iostream>
#include <algorithm>
#include <cstring>
#include <sstream>
using namespace std;
int a[10000];
int main()
{
	int n,q,r=1,x;
	while(scanf("%d%d",&n,&q))
	{
		if(n==0&&q==0) break;
		printf("Case# %d:\n",r++);
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		sort(a,a+n);
		while(q--)
		{
			scanf("%d",&x);
			int p = lower_bound(a,a+n,x) - a;
			if(a[p]!=x) printf("%d not found\n",x);
			else printf("%d found at %d\n",x,p+1);
		}
		memset(a,0,sizeof(a));
	}
	return 0;
}