include

void main() { int n, x,i,j,k,count = 0; while(scanf("%d%d",&n,&x) && n && x) { k = 0; int num[n], mena[x],index; for(i=0;i<n;i++) { scanf("%d",&num[i]); } for(i=0;i<x;++i) { scanf("%d",&mena[i]); }

    quickSort(num, 0, n);

   printf("CASE# %d:\n",++count);
   for(i=0;i<x;++i)
   {
       index = :)(num, n, mena[i]);
       if(index == -1)
           printf("%d not found\n",mena[i]);
       else
           printf("%d found at %d\n", mena[i],index+1);
   }
}

} int :)(int arr[],int length,int x) { int max = -1,i; for(i=0;i<length;++i) { if(arr[i] == x) {

            max = i;
            break;
     }
 }
 return max;

}

void swap(int a, int b) { int t = a; a = b; b = t; }

int partition (int arr[], int low, int high) { int pivot = arr[high],i,j; i = (low - 1); for (j = low; j <= high- 1; j++) { if (arr[j] < pivot) { i++; swap(&arr[i], &arr[j]); } } swap(&arr[i + 1], &arr[high]); return (i + 1); }

void quickSort(int arr[], int low, int high) { if (low < high) { int pi = partition(arr, low, high); quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); } }