#include <bits/stdc++.h>
using namespace std;

const int N = 1111;
int input[N];

int str_to_int(string& str, int m) {
    int ans = 0, cur = 1;
    for (int i = 0; i < m; ++i, cur <<= 1) {
        if (str[i] == 'A') ans += cur;
    }
    return ans;
}

unordered_map<int,int> umap;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int T, n, m, k;
    cin >> T;
    for (int t = 1; t <= T; ++t) {
        cin >> n >> m >> k;

        // Encode string to integer
        string str;
        for (int i = 0; i < n; ++i) {
            cin >> str;
            input[i] = str_to_int(str, m);
        }

        // Traverse the subsets
        int ans = 0;
        for (int i = 1, j = (1<<m); i < j; ++i) {
            int equal_pair = 0;
            umap.clear();
            for (int q = 0; q < n; ++q) {
                int temp = (input[q] & i);
                equal_pair += umap[temp];
                umap[temp]++;
            }
            if (2 * (equal_pair + k) <= n*(n-1)) ans++;
        }

        cout << "Case #" << t << ": " << ans << endl;
    }
}