#include<bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define debug(x) cerr<<#x<<"="<<x<<endl
#define fgx cerr<<"-------------"<<endl
#define N 1100
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
char c[N][20];int num[N],a[N];
int main()
{    int t; cin>>t;
    for(rint T=1;T<=t;T++)
    {    int n,m,k,ans=0; scanf("%d%d%d",&n,&m,&k);
        memset(a,0,sizeof(a));
        for(rint i=1;i<=n;i++) scanf("%s",c[i]);
        for(rint i=1;i<=n;i++) for(rint j=0;j<m;j++) if(c[i][j]=='A') a[i]|=1<<j;
        for(rint s=0;s<(1<<m);s++)
        {    memset(num,0,sizeof(num)); int sum=0;
            for(rint i=1;i<=n;i++) num[a[i]&s]++;
            for(rint i=0;i<(1<<m);i++) sum+=num[i]*(n-num[i]);
            if(sum/2>=k) ans++;
        }
        printf("Case #%d: %d\n",T,ans);
    }
    return 0;
}