大理石在哪

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10000;
int main()
{
	int n, q, x, a[maxn], kase = 0;
	while (scanf_s("%d%d", &n, &q) == 2 && n)
	{
		printf("CASE# %d:\n", ++kase);
		for (int i = 0; i < n; i++)	scanf_s("%d", &a[i]);
		sort(a, a + n);
		while (q--)
		{
			scanf_s("%d", &x);
			int p = lower_bound(a, a + n, x) - a;
			if (a[p] == x)	printf("%d found at %d\n", x, p + 1);
			else printf("%d not found\n", x);
		}
	}
	system("pause");
	return 0;
}