#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
inline void read(int &x) {
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
inline ui R() {
    static ui seed=416;
    return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
int n,m,k,cnt[1025],v[1025];char s[1025][12];
int main() {
    int T;read(T);
    rep(Case,1,T){
        read(n);read(m);read(k);
        rep(i,1,n)scanf("%s",s[i]+1);memset(v,0,sizeof(v));
        rep(i,1,n)rep(j,1,m)v[i]+=(s[i][j]=='A')<<(j-1);
        int res=0;
        rep(i,0,(1<<m)-1){
            memset(cnt,0,sizeof(cnt));
            rep(j,1,n)cnt[v[j]&i]++;
            int tot=n*(n-1)/2;rep(j,0,1023)tot-=cnt[j]*(cnt[j]-1)>>1;
            res+=tot>=k;
        }
        printf("Case #%d: %d\n",Case,res);
    }
    return 0;
}