//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<ctime>
#include<vector>
#include<set>
#include<cfloat>
#include<sstream>

using namespace std;

const int maxn=1250;
//const long long INF=999999999999999;
const int INF=999999999;
//const float eps = 0.00000001;
const int mod=1000000007;
//const long long mod=100000000000000;
//const int VM=15;
const int VM=100210;
const int EM=500010;
//const int N=120;
//const double PI=3.14159;
//const double PI=3.14159265359;
const double PI=acos(-1.0);     //圆周率PI
const double eps=1e-10;
const int N=500220;

typedef pair<int,int> P;
//int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//int dir[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
int dir[4][2]={{1,0},{0,-1},{-1,0},{0,1}};
#define L(x) (x<<1)
#define R(x) (x<<1|1)

/**

*/

struct node{
    int a,b,c,d;
}ip[120000];

int main(){

    //freopen("input.txt","r",stdin);

    //freopen("out.txt","w",stdout);


    int t,cases=0;
    scanf("%d",&t);
    int n,m;
    char str[50];
    map<long long,int> mp;
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++){
            scanf("%s",str);
            sscanf(str,"%d.%d.%d.%d",&ip[i].a,&ip[i].b,&ip[i].c,&ip[i].d);
        }
        printf("Case #%d:\n",++cases);
        int ans=0;
        int a,b,c,d;
        for(int i=0;i<m;i++){
            scanf("%s",str);
            sscanf(str,"%d.%d.%d.%d",&a,&b,&c,&d);
            ans=0;
            mp.clear();
            long long tmp;
            int ta=a,tb=b,tc=c,td=d;
            for(int j=0;j<n;j++){
                ta=a&ip[j].a;
                tb=b&ip[j].b;
                tc=c&ip[j].c;
                td=d&ip[j].d;
                tmp=ta*255*255*255+tb*255*255+tc*255+td;
                if(mp[tmp]==0){
                    mp[tmp]=1;
                    ans++;
                }
            }
            printf("%d\n",ans);
        }

    }

    return 0;
}