#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int M=2010;
int cas,n,m,k,i,j,a[M],A[M];
char s[20];
int main(){
    scanf("%d",&cas);
    for (int Cas=1;Cas<=cas;Cas++){
        memset(a,0,sizeof a);
        memset(A,0,sizeof A);
        scanf("%d%d%d",&n,&m,&k);
        for (i=1;i<=n;i++){
            scanf("%s",s);
            for (j=0;j<m;j++)if (s[j]=='B')a[i]^=1<<j;
        }
        for (i=1;i<=n;i++)
            for (j=i+1;j<=n;j++)A[a[i]^a[j]]++;
        int ans=0;
        for (i=0;i<1<<m;i++){
            int cnt=n*(n-1)/2;
            for (j=i;j;j=(j-1)&i)cnt-=A[j];
            if (cnt>=k)ans++;
        }
        printf("Case #%d: %d\n",Cas,ans);
    }
}