#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;

const int N=1100;
int dp[N],a[N],n,m;
char s[N][15];

void init(){
    memset(dp,0,sizeof(dp));
}

int main(){
//    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    int i,j,k,T,cas;
    scanf("%d",&T);
    cas=0;
    while(T--){
        cas++;
        printf("Case #%d: ",cas);
        scanf("%d%d%d",&n,&m,&k);
        init();
        for(i=1;i<=n;i++){
            scanf("%s",s[i]);
            a[i]=0;
            for(j=0;j<m;j++)
                a[i]=(a[i]<<1)+(s[i][j]-'A');
        }
        for(i=1;i<=n;i++)
            for(j=i+1;j<=n;j++)
                dp[a[i]^a[j]]++;
        for(i=0;i<m;i++)
            for(j=0;j<(1<<m);j++)
                if(j&(1<<i))
                    dp[j]+=dp[j^(1<<i)];
        int ans=0;
        for(i=0;i<(1<<m);i++)
            if(n*(n-1)/2-dp[i]>=k)
                ans++;
        printf("%d\n",ans);
    }
    return 0;
}