#include<bits/stdc++.h>
#define clr(x) memset(x,0,sizeof(x))
#define clr_1(x) memset(x,-1,sizeof(x))
#define INF 0x3f3f3f3f
#define LL long long
#define pb push_back
#define ls(i) (i<<1)
#define rs(i) (i<<1|1)
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
using namespace std;
const int N=1e3+100;
const int M=2e1+10;
int num[N];
int inf[N];
char s[N];
int n,m,k,T;
int t,ct,ed;
int ans;
int main()
{
    cin>>T;
    for(int kase=1;kase<=T;kase++)
    {
        cout<<"Case #"<<kase<<": ";
        cin>>n>>m>>k;
        for(int i=1;i<=n;i++)
        {
            cin>>s;
            t=0;
            for(int j=0;j<m;j++)
            {
                t<<=1;
                t|=(s[j]=='A'?0:1);
            }
            inf[i]=t;
        }
        ans=0;
        ed=1<<m;
        for(int i=0;i<ed;i++)
        {
            clr(num);
            for(int j=1;j<=n;j++)
                num[i&inf[j]]++;
            ct=0;
            for(int j=0;j<ed;j++)
                if(num[j]) ct+=num[j]*(n-num[j]);
            ct/=2;
            if(ct>=k)
                ans++;
        }
        cout<<ans<<endl;
    }
    return 0;
}