#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;

map<pair<int,pair<int,pair<int,int> > >,int>Q;
int main(){
    int T_T;
    scanf("%d",&T_T);
    for(int test=1;test<=T_T;test++){
        int n,m;
        char op;
        int a[1005],b[1005],c[1005],d[1005];
        int A[1005],B[1005],C[1005],D[1005];
        cin>>n>>m;
        for(int i=0;i<n;i++){
            scanf("%d.%d.%d.%d",&a[i],&b[i],&c[i],&d[i]);
        }
        cout<<"Case #"<<test<<":"<<endl;
        for(int i=0;i<m;i++){
            scanf("%d.%d.%d.%d",&A[i],&B[i],&C[i],&D[i]);
            Q.clear();
            for(int j=0;j<n;j++){
                Q.insert(make_pair(make_pair((A[i]&a[j]),make_pair((B[i]&b[j]),make_pair((C[i]&c[j]),(D[i]&d[j])))),1));
            }
            cout<<Q.size()<<endl;
        }
   }
    return 0;
}