UVA - 10474 - Where is the Marble?

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MaxSize 10000
int cmp_digit(const void *_a,const void *_b)
{
    int *a=(int *)_a;
    int *b=(int *)_b;
    return *(int *)a-*(int *)b;
}    
int Find(const int a[],const int b[],const int n,const int q)
{
    bool flag=false;
    for(int i=0;i<q;i++)
    {
        flag=false;
        for(int j=0;j<n;j++)
        {
            if(a[j]==b[i])
            {
                flag=true;
                printf("%d found at %d\n",b[i],j+1);
                break;
            }  
            if(a[j]>b[i]&&!flag)
            {
                flag=true;
                printf("%d not found\n",b[i]);
                break;
            }                     
            if(a[0]>b[i]||a[n-1]<b[i])
            {
                printf("%d not found\n",b[i]);
                break;
            }     
        }
    }
    return 0;
}            
int main()
{
   // freopen("10474in.txt","r",stdin);
   // freopen("10474out.txt","w",stdout);
    int N,Q,game=1;
    int marble[MaxSize],quer[MaxSize];
    while(scanf("%d%d",&N,&Q)!=EOF && N && Q)
    {
        for(int i=0;i<N;i++)
        {
            scanf("%d",&marble[i]);
        }
        for(int i=0;i<Q;i++)
        {
            scanf("%d",&quer[i]);
        }
        qsort(marble,N,sizeof(int),cmp_digit);
        printf("CASE# %d:\n",game);
        Find(marble,quer,N,Q);
        game++;
        memset(marble,0,sizeof(marble));
        memset(quer,0,sizeof(quer));
    }
    return 0;
}