UVA - 10474 Where is the Marble?

#include<cstdio>

int main() {

	int N, Q;
	int number[10100];
	int qu[10100];
	int count = 1;
	while(scanf("%d%d", &N, &Q)) {
		if(N == 0 && Q == 0)
			break;
		printf("CASE# %d:\n",count++)	;
		for(int i = 0; i < N; i++)
			scanf("%d", &(number[i]));
		for(int i = 0; i < Q; i++)
			scanf("%d", &(qu[i]));
	
		int mark;
		int num;

		for(int i = 0; i < Q; i++) {
			mark = 0;
			num = 0;
			for( int j = 0; j < N; j++ ) {
				if(qu[i] >  number[j])	{
					num++;
				}
				if(qu[i] == number[j])
					mark++;	
			}
			if(mark == 0)
				printf("%d not found\n", qu[i]);
			else
				printf("%d found at %d\n", qu[i], num+1);
		}
	}
	return 0;
}