#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;
#define N 1050
#define Base 256
int val[N],n,m,t,Now;map <int,int> li;
inline int Read()
 {
     int x=0;char y;
     do y=getchar(); while (y<'0'||y>'9');
     do x=x*10+y-'0',y=getchar(); while (y>='0'&&y<='9');
     return x;
 }
inline int Get()
 {
     int x=Read(),y=Read(),z=Read(),o=Read();
     return ((x*Base+y)*Base+z)*Base+o;
 }

int main()
 {
     //freopen("input.txt","r",stdin);
     t=Read();
     for (int T=1;T<=t;T++)
      {
          n=Read();m=Read();
          printf("Case #%d:\n",T);
          for (int i=1;i<=n;i++) val[i]=Get();
          for (int i=1;i<=m;i++)
           {
               Now++;int e=Get(),ans=false;
               for (int j=1;j<=n;j++)
                {
                    int k=val[j]&e,l=li[k];
                    if (l==Now) continue;
                    li[k]=Now;ans++;
                }
               printf("%d\n",ans);
           }
      }
     return 0;
 }