#include<iostream>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>

#define rep(i,e) for(int i=0;i<(e);i++)
#define rep1(i,e) for(int i=1;i<=(e);i++)
#define repx(i,x,e) for(int i=(x);i<=(e);i++)
#define pii pair<int,int>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define mset(var,val) memset(var,val,sizeof(var))
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define IOS ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

typedef long long ll;
template <class T>
void test(T a){cout<<a<<endl;}
template <class T,class T2>
void test(T a,T2 b){cout<<a<<" "<<b<<endl;}
template <class T,class T2,class T3>
void test(T a,T2 b,T3 c){cout<<a<<" "<<b<<" "<<c<<endl;}
const int N = 2e3+10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;

char s[N];
int a[N];
int cnt[N];

int T = 1;
void work(){
    printf("Case #%d: ", T++);
    int n, m, k;
    cin >> n >> m >> k;
    rep(i,n){
        cin >> s;
        int x = 0;
        rep(j,m){
            if(s[j] == 'A'){
                x ^= 1<<j;
            }
        }
        a[i] = x;
    }
    int res = 0;
    for(int msk = 0; msk < 1 << m; ++msk){
        rep(i,1<<m){
            cnt[i] = 0;
        }
        int ans = 0;
        rep(i,n){
            int now = a[i]&msk;
            ans += i-cnt[now];
            cnt[now]++;
        }
        if(ans >= k)
        ++res;
    }
    printf("%d\n", res);
}

int main() {
    #ifdef local
    freopen("in.txt","r",stdin);
    #endif // local
    IOS;
    int t;
//    scd(t);
    cin >> t;
    for(;t--;){
        work();
    }
//    work();
}