UVA 10474 Where is the Marble?(

UVA 10474 Where is the Marble?

#include<stdio.h>
#include<stdlib.h>
int com(const void *a1,const void *a2)
{
return *(int *)a1-*(int *)a2;
}
int main()
{
int n,m;
int i,j,k=1;
int s[20000];
int p,num;
while(~scanf("%d%d",&n,&m))
{
if(n==0&m==0)   break;

printf("CASE# %d:\n",k);
k++;
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
}
qsort(s,n,sizeof(s[0]),com);
for(i=0;i<m;i++)
{
scanf("%d",&num);
p=0;
for(j=0;j<n;j++)
{
if(num==s[j])
{
p=1;
printf("%d found at %d\n",num,j+1);
break;
}
}
if(p==0)  printf("%d not found\n",num);
}
}

return 0;
}