#include <cstdio>
#include <cstring>

using namespace std;

typedef long long ll;

const int N = 1010, S = 1 << 10;

int sum[S], v[N];
char s[11];

int main() {
    int t;
    scanf("%d", &t);
    for (int cs = 1; cs <= t; ++cs) {
        int n, m, k;
        scanf("%d%d%d", &n, &m, &k);
        for (int i = 1; i <= n; ++i) {
            scanf("%s", s);
            v[i] = 0;
            for (int j = 0; j < m; ++j)
                v[i] = (v[i] << 1) | (s[j] == 'B');
        }
        memset(sum, 0, sizeof(sum));
        for (int i = 1; i < n; ++i)
            for (int j = i + 1; j <= n; ++j)
                ++sum[(~(v[i] ^ v[j])) & ((1 << m) - 1)];
        for (int i = 0; i < m; ++i)
            for (int s = 0; s < (1 << m); ++s)
                if (!((s >> i) & 1))
                    sum[s] += sum[s ^ (1 << i)];
        int ans = 0;
        for (int s = 1; s < (1 << m); ++s)
            if (n * (n - 1) / 2 - sum[s] >= k)
                ++ans;
        printf("Case #%d: %d\n", cs, ans);
    }
    return 0;
}