#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 1030
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
int _2[12];
int i,j,k,K,n,m,s,T,al,a[N],b[N],xu[N];
int f[N][N];
int cs,ans;
char ch;
int get(int n){return n*(n-1)>>1;}
void write(int c,int x){
    printf("Case #%d: %d\n",c,x);
}
int main(){
    _2[1]=1;
    fo(i,2,11)_2[i]=_2[i-1]*2;
    scanf("%d",&T);
    while(T--){
        memset(f,0,sizeof(f));
        memset(xu,0,sizeof(xu));
        scanf("%d%d%d\n",&n,&m,&k);
        fo(i,1,n){
            a[i]=0;
            fo(j,1,m){
                ch=getchar();
                while(ch<'A'||ch>'B')ch=getchar();
                if(ch=='B')a[i]|=_2[j];
            }
        }
        al=get(n);
        if(k>al){
            write(++cs,0);
            continue;
        }
        ans=0;
        fo(s,1,_2[m+1]-1){
            fo(i,1,n){
                b[i]=a[i]&s;
                f[s][b[i]]++;
            }
            fo(i,0,_2[m+1]-1)xu[s]+=get(f[s][i]);
            xu[s]=al-xu[s];
            if(xu[s]>=k)ans++;
        }
        write(++cs,ans);
    }
    return 0;
}