#include <stdio.h> 

#include <stdlib.h> 

#include <string.h> 

#include <math.h> 

struct IP 

{  

    int a,b,c,d; 

};  

int i,j,k,l,m,n,o,p,q,x,y,z,aa,bb,cc,dd; 

struct IP a[1010],b,c[50010],d; 

char ch[100]; 

int dfs() 

{  

    int i;  

    for (i=1; i<=q; i++)  

        if ((c[i].a==d.a)&&(c[i].b==d.b)&&(c[i].c==d.c)&&(c[i].d==d.d)) return 0; 

    return 1; 

} 


int main() 

{  

    scanf("%d",&n);  

    for (l=1; l<=n; l++) 

    {  

        memset(a,0,sizeof(a)); 

        memset(c,0,sizeof(c)); 

        q=0;  

        scanf("%d%d",&x,&y); 

        for (j=1; j<=x; j++) 

        {  

            scanf("%s",&ch); 

            z=0; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            a[j].a=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9))  

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            a[j].b=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            a[j].c=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            a[j].d=p; 

        } 

  

        printf("Case #%d:\n",l); 

        for (j=1; j<=y; j++) 

        {  

            q=0;  

            memset(c,0,sizeof(c)); 

            scanf("%s",&ch); 

            z=0; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            b.a=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            b.b=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++;   

            }  

            b.c=p; 

            z=z+1; 

            p=0;  

            while ((ch[z]>47)&&(ch[z]<=48+9)) 

            {  

                p=p*10+ch[z]-48; 

                z++; 

            }  

            b.d=p;  

            for (k=1; k<=x; k++) 

            {  

                aa=(a[k].a)&(b.a); 

                bb=(a[k].b)&(b.b); 

                cc=(a[k].c)&(b.c); 

                dd=(a[k].d)&(b.d); 

                d.a=aa; 

                d.b=bb; 

                d.c=cc; 

                d.d=dd; 

                if (q==0) 

                {  

                    q++; 

                    c[q]=d; 

                    continue; 

                }  

                if (dfs()) 

                {  

                    q++; 

                    c[q]=d; 

                } 

            }  

            printf("%d\n",q); 

        } 

 

  

    }  

    return 0; 

}