#include<bits/stdc++.h>
using namespace std;
#define y1 y114514
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define all(a) a.begin(), a.end()
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef long long ll;
const int M = 1000000007;

const int maxn = 1005;
int T, n, m, k, ca;
char str[15];
int a[maxn];
int cnt[1 << 10];

int main(){
    scanf("%d", &T);
    while(T--){
        scanf("%d%d%d", &n, &m, &k);
        for(int i = 1; i <= n; ++i){
            a[i] = 0;
            scanf("%s", str);
            for(int j = 0; j < m; ++j)
                a[i] |= (str[j] == 'A') << j; 
        }
        int ans = 0;
        for(int mask = 1; mask < (1 << m); ++mask){
            memset(cnt, 0, sizeof(cnt));
            for(int i = 1; i <= n; ++i)
                cnt[a[i] & mask]++;
            int now = 0, tmp = 0;
            for(int i = 0; i < 1 << m; ++i){
                tmp += now * cnt[i];
                now += cnt[i];
            }
            ans += tmp >= k;
        }
        printf("Case #%d: %d\n", ++ca, ans);
    }

    return 0;
}