#include<cstdio>
#include<algorithm>
#include<cstring>
#define re register
#define rep(i,s,t) for(re int i=s;i<=t;++i)
using namespace std;
#define gi(x) read(x)
#define gii(x,y) read(x),read(y)
#define giii(x,y,z) read(x),read(y),read(z)
#define ms(f,x) memset(f,x,sizeof f)
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
namespace IO{
    #define gc getchar()
    #define pc(x) putchar(x)
    template<typename T>inline void read(T &x){
        x=0;int f=1;char ch=gc;while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=gc;}
        while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=gc;x*=f;return;
    }
    template<typename T>inline void write(T x=0){
        T wr[51];wr[0]=0;if(x<0)pc('-'),x=-x;if(!x)pc(48);
        while(x)wr[++wr[0]]=x%10,x/=10;while(wr[0])pc(48+wr[wr[0]--]);return;
    }
}
using IO::read;
using IO::write;
const int N=2333;
int T,n,m,k,ans;
char s[N][N];
int tot,cnt[N];
int t[N],ss[N];
int main(){
    gi(T);
    rep(p,1,T){
        ans=0;
        giii(n,m,k);
        rep(i,1,n){
            scanf("%s",s[i]+1);
            t[i]=0;
            rep(j,1,m)
                t[i]=t[i]<<1|(s[i][j]=='B');
        }
        rep(i,0,(1<<m)-1){
            tot=n*(n-1)/2;
            rep(j,1,n){
                ss[j]=t[j]&i;
                tot-=cnt[ss[j]];
                ++cnt[ss[j]];
            }
            if(tot>=k)
                ++ans;
            rep(j,1,n){
                ss[j]=t[j]&i;
                --cnt[ss[j]];
            }
        }
        printf("Case #%d: %d\n",p,ans);
    }
    return 0;
}