#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

char s[1010][15];
int vis[2010];

int main()
{
    for ( int T ; scanf ( "%d" , &T )==1 ; )
    {
        for ( int cas=1 ; cas<=T ; cas++ )
        {
            int n,m,k,ans=0;
            scanf ( "%d%d%d" , &n , &m , &k );
            for ( int i=0 ; i<n ; i++ )
                scanf ( "%s" , s[i] );
            for ( int i=1 ; i<(1<<m) ; i++ )
            {
                memset ( vis , 0 , sizeof(vis) );
                for ( int p=0 ; p<n ; p++ )
                {
                    int sum = 0;
                    for ( int q=0 ; q<m ; q++ )
                        if ( i&(1<<q) )
                            sum = sum*2+s[p][q]-'A';
                    vis[sum]++;
                }
                int cnt = 0;
                for ( int i=0 ; i<(1<<m) ; i++ )
                    cnt += vis[i]*(n-vis[i]);
                if ( cnt/2>=k )
                    ans++;
            }
            printf ( "Case #%d: %d\n" , cas , ans );
        }
    }
    return 0;
}