#include <iostream>
#include <cstdio>
#include <map>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>

using namespace std;

#define N 1005
#define mod 1000000007
#define ll long long
#define inf 0x3fffffff

int n,m;
unsigned int a[5];
unsigned int c[N],d[N],x;
map<unsigned int,int>mp;

int main()
{
    int T;
    int i,j;
    //freopen("in.txt","r",stdin);
    scanf("%d",&T);
    for(int ccnt = 1;ccnt <= T;ccnt++){
        scanf("%d%d",&n,&m);
        for(i = 0;i < n;i++){
            scanf("%u.%u.%u.%u",&a[0],&a[1],&a[2],&a[3]);
            c[i] = (a[0] << 24) | (a[1] << 16) | (a[2] << 8) | a[3];
            //printf("%u\n",c[i]);
        }
        for(i = 0;i < m;i++){
            scanf("%u.%u.%u.%u",&a[0],&a[1],&a[2],&a[3]);
            d[i] = (a[0] << 24) | (a[1] << 16) | (a[2] << 8) | a[3];
        }
        printf("Case #%d:\n",ccnt);
        for(i = 0;i < m;i++){
            mp.clear();
            for(j = 0;j < n;j++){
                x = d[i] & c[j];
                mp[x] ++;
            }
            printf("%d\n",mp.size());
        }

    }

    return 0;
}