#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <map>
#include <queue>
#include <set>
using namespace std;
map<long long,int> q;
const long long X = 256LL;
int ip[1010][4];
long long cal( int a , int b )
{
    long long ans = 0;
    for( int i=0 ; i<4 ; i++ ) ans = ans * X + ( ip[a][i] & ip[b][i] );
    return ans;
}
int main()
{
    int t , n , m;
    scanf( "%d" , &t );
    for( int cas = 1 ; cas <= t ; cas++ )
    {
        scanf( "%d %d" , &n , &m );
        for( int i=0 ; i<n ; i++ ) scanf( "%d.%d.%d.%d" , &ip[i][0] , &ip[i][1] , &ip[i][2] , &ip[i][3] );
        printf( "Case #%d:\n" , cas );
        while( m-- )
        {
            q.clear();
            int ans = 0;
            scanf( "%d.%d.%d.%d" , &ip[n][0] , &ip[n][1] , &ip[n][2] , &ip[n][3] );
            for( int i=0 ; i<n ; i++ )
            {
                long long tt = cal( i , n );
                if( q[tt] != 0 ) continue;
                q[tt] = 1;
                ans++;
            }
            printf( "%d\n" , ans );
        }
    }
    return 0;
}