#include<bits/stdc++.h>
#define maxm 12
#define maxn 1005
#define maxs (1<<maxm)
using namespace std;

int n,m,k;
int w[maxn];

char s[maxm];

int cnt[maxs];

void init()
{
    scanf("%d%d%d",&n,&m,&k);
    for (int i=0;i<n;++i)
    {
        w[i]=0;
        scanf("%s",s);
        for (int j=0;j<m;++j)
            if (s[j]=='A')
                w[i]|=(1<<j);
    }
}

void solve()
{
    int ans=0,status=(1<<m);
    for (int s=0;s<status;++s)
    {
        memset(cnt,0,sizeof(cnt));
        int sum=0;
        for (int i=0;i<n;++i)
        {
            int t=w[i]&s;
            sum+=(i-cnt[t]);
            cnt[t]++;
        }
        if (sum>=k)
            ++ans;
    }
    printf("%d\n",ans);
}

int main()
{
//    freopen("c.in","r",stdin);
    int T,icase=0;
    scanf("%d",&T);
    while (T--)
    {
        printf("Case #%d: ",++icase);
        init();
        solve();
    }
    return 0;
}