#include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &x,T y){return (y>x)?(x=y,1):0;}
inline int read(){
    int x;
    char c;
    int f=1;
    while((c=getchar())!='-' && (c>'9' || c<'0'));
    if(c=='-') f=-1,c=getchar();
    x=c^'0';
    while((c=getchar())>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0');
    return x*f;
}
inline ll readll(){
    ll x;
    char c;
    int f=1;
    while((c=getchar())!='-' && (c>'9' || c<'0'));
    if(c=='-') f=-1,c=getchar();
    x=c^'0';
    while((c=getchar())>='0' && c<='9') x=(x<<1ll)+(x<<3ll)+(c^'0');
    return x*f;
}
const int maxn=1024+10;
char s[maxn];
int a[maxn],b[maxn];
int main(){
#ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
#endif
    int T=read();
    REP(_,1,T){
        int n=read(),m=read(),k=read();
        REP(i,1,n){
            scanf("%s",s+1);
            a[i]=0;
            REP(j,1,strlen(s+1)) a[i]=(a[i]<<1)|(s[j]-'A');
        }
        int ans=0;
        REP(i,0,(1<<m)-1){
            int res=0;
            REP(j,0,iend) b[j]=0;
            REP(j,1,n) res+=j-1-b[a[j]&i],++b[a[j]&i];
            ans+=(res>=k);
        }
        printf("Case #%d: %d\n",_,ans);
    }
    return 0;
}