#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define mid (l+r>>1)
#define M 10020
using namespace std;
int read(){
    int nm=0,fh=1;char cw=getchar();
    for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
    for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
    return nm*fh;
}
int T,n,m,K,ans,tot,t1,p[M],t[M];
char ch[20];
void dfs(int pos,int num){
    if(pos==m){
        int sum=0;
        for(int i=0;i<=num;i++) t[i]=0;
        for(int i=1;i<=n;i++) t[p[i]&num]++;
        for(int i=0;i<=num;i++){
            sum+=t[i]*(n-t[i]);
            if(sum>=K){ans++;return;}
        }
        return; 
    }
    dfs(pos+1,num),dfs(pos+1,num|(1<<pos));
}
int main(){
    T=read();
    for(int tt=1;tt<=T;tt++,ans=0){
        n=read(),m=read(),K=read(),K<<=1;
        for(int i=1;i<=n;i++){
            scanf("%s",ch),p[i]=0;
            for(int j=0;j<m;j++) if(ch[j]=='A') p[i]|=(1<<j);
            //printf("%d %d\n",i,p[i]);
        }
        dfs(0,0),printf("Case #%d: %d\n",tt,ans);
    }
    return 0;
}