#include <stdio.h>
#include <string.h>

#define M   10001

int main()
{
    unsigned N, Q, count = 1;
    while (scanf("%u%u", &N, &Q) == 2 && N && Q) {
        unsigned i, j;
        unsigned p[M];
        memset(p, 0, sizeof(p));
        for (i = 0; i < N; i++) {
            unsigned tmp;
            scanf("%u", &tmp);
            p[tmp]++;
        }
        for (i = 0, j = 0; j < N; i++)
            if (p[i]) {
                unsigned pos = j + 1;
                j += p[i];
                p[i] = pos;
            }
        printf("CASE# %u:\n", count);
        for (i = 0; i < Q; i++) {
            unsigned tmp;
            scanf("%u", &tmp);
            if (p[tmp])
                printf("%u found at %u\n", tmp, p[tmp]);
            else
                printf("%u not found\n", tmp);
        }
        count++;
    }
    return 0;
}