//Δ_1001
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1111;
int n,m,k,a[N],b[N];
int solve(){
    int w=1<<m,i,j,s=0,t;
    for(i=0;i<w;i=i+1){
        memset(b,0,sizeof(b));
        for(j=0;j<n;j=j+1)
            b[a[j]&i]++;
        t=n*(n-1)/2;
        for(j=0;j<w;j=j+1)
            t-=b[j]*(b[j]-1)/2;
        if(t>=k)
            s++;
    }
    return s;
}
int main()
{
    int tc,tt,i,j,x;
    char ch[11];
    cin>>tc;
    for(tt=1;tt<=tc;tt++){
        memset(a,0,sizeof(a));
        cin>>n>>m>>k;
        for(i=0;i<n;i=i+1){
            cin>>ch;
            a[i]=0;
            for(j=0;j<m;j=j+1)
                a[i]=a[i]<<1|(ch[j]=='B');
        }
        cout<<"Case #"<<tt<<": "<<solve()<<endl;
    }
    return 0;
}