//Relive your past life.
//Face your demons.
//The past is never dead,it is not even past.
//The memories are not only the key to the past but...also to the future.
//coded in Rusty Lake
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define ll   long long
#define pb   push_back
#define mp   make_pair
#define orz  1000000007
using namespace std;
int T,n,m,k,f[1030],a[1005],cnt,ok[1030];
int main(){
    scanf("%d",&T);
    for(int _=1;_<=T;++_){
        printf("Case #%d: ",_);
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;++i){
            a[i]=0;
            for(int j=0;j<m;++j){
                char c;
                scanf(" %c",&c);
                if(c=='B')a[i]|=(1<<j);
            }
        }
        memset(ok,0,sizeof(ok));
        int ans=0;
        for(int i=1;i<(1<<m);++i){
            for(int j=0;j<m;++j)ok[i]|=ok[i^(1<<j)];
            if(ok[i]){
                ++ans;
                continue;
            }
            memset(f,0,sizeof(f));
            for(int j=1;j<=n;++j)++f[a[j]&i];
            int o=n*(n-1)/2;
            for(int j=0;j<(1<<m);++j)o-=f[j]*(f[j]-1)/2;
            if(o>=k){
                ok[i]=1;
                ++ans;
            }
        }
        printf("%d\n",ans);
    }
    //system("pause");
    return 0;
}