Uva 10474

#include<iostream>  //lower_bound 查找大于或者等于X的第一个位置（返回地址）
#include<algorithm>
using namespace std;
const int maxn = 1000;
int main()
{
	int n, q, x, a[maxn], kase = 0;
	while (scanf("%d%d",&n,&q) == 2 && n)
	{
		cout << "Case:" << ++kase << endl;
		for (int i = 0; i < n; i++)
			cin >> a[i];
		sort(a, a + n);
		while (q--){
			cin >> x;
			int p = lower_bound(a, a + n, x) - a;
			if (a[p] == x) 
				cout << "Found " << x << " at" << p+1  << endl;
			else
				cout << "No found" << endl;
		}
	}
	return 0;
}