#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(a,b,c) for(int a=b;a<=c;a++)
#define FORD(a,b,c) for(int a=b;a>=c;a--)
#define FORL(a,b) for(int a=head[b];a;a=nxt[a])
#define in(a)  a=read()
#define out(a) printf("%d\n",a)
#define clr(x,y) memset(x,y,sizeof(x))
inline ll read(){
    ll f=1,x=0;char c=getchar();
    while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
    return x*f;
}
/*------------------------------------------------------------*/
#define mod 10007
#define maxn 100010
#define inf (1<<30)
/*------------------------------------------------------------*/
int n,m,num;
int f[20010],a[20010];
char s[10010][20];
int main(){
    int t;
    in(t);
    FOR(q,1,t){
        int K;
        in(n);in(m);in(K);
        FOR(i,1,n){
            scanf("%s",s[i]);
            a[i]=0;
            FOR(j,0,m-1)
                if(s[i][j]=='A')
                    a[i]+=(1<<j);
        }
        int A=0;
        FOR(i,0,(1<<m)-1){
            int ans=n*(n-1)/2;
            FOR(j,1,n){
                f[(a[j]&i)]++;
                ans-=f[(a[j]&i)]-1;
            }
            FOR(j,1,n)f[(a[j]&i)]--;
            if(ans>=K)A++;
        }
        printf("Case #%d: %d",q,A); 
        printf("\n"); 
    }
}