#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<map>
using namespace std;
#define u32 unsigned int
#define ll long long
map<unsigned int,int>mp;
int a[1005][4],b[55][4],tot=0,tt=0;
int read(){
    char ch=getchar();
    while(ch<'0' || ch>'9')ch=getchar();
    int ans=0;
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    return ans;
}
void solved(){
     printf("Case #%d:\n",++tot);
     int n,m;
     scanf("%d%d",&n,&m);
     for(int i=1;i<=n;i++)a[i][0]=read(),a[i][1]=read(),a[i][2]=read(),a[i][3]=read();
     for(int i=1;i<=m;i++)b[i][0]=read(),b[i][1]=read(),b[i][2]=read(),b[i][3]=read();
     for(int i=1;i<=m;i++){
       ++tt;
       int ans=0;
       for(int j=1;j<=n;j++){
         u32 t1=b[i][0]&a[j][0],t2=b[i][1]&a[j][1],t3=b[i][2]&a[j][2],t4=b[i][3]&a[j][3];
         u32 t=(t1<<24)+(t2<<16)+(t3<<8)+t4;
         if(mp[t]<tt)++ans,mp[t]=tt;
         }
       printf("%d\n",ans);
     }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--)solved();
    return 0;
}