uva 10474

#include <stdio.h>

int cases = 1;

int main()
{	
	int m, n, i;
	while(2 == scanf("%d%d",&m, &n) && m && n){
		printf("CASE# %d:\n", cases++);
		int a[10001] = {0}, b[10001] = {0};
		while(m--){ scanf("%d", &i); ++a[i]; }
		for(i = 1; i < 10001; i++) { b[i] = b[i - 1] + a[i - 1];}
		while(n--) {
			scanf("%d", &i);
			if(0 == a[i]){	printf("%d not found\n", i);
			}else{ printf("%d found at %d\n", i, b[i] + 1); }
		}
	}
	return 0;
}