#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int LL
const int N = 5e6 + 7;
const int p = 998244353;
void add(int &x, int y)
{
    (x += y) >= p && (x -= p);
}
void sub(int &x, int y)
{
    (x -= y) >= p && (x += p);
}
struct FWT {
    int extend(int n)
    {
        int N = 1;
        for (; N < n; N <<= 1);
        return N;
    }
    void FWTxor(vector<int> &a, bool rev)
    {
        int n = a.size(), inv2 = (p + 1) >> 1;
        for (int l = 2, m = 1; l <= n; l <<= 1, m <<= 1) {
            for (int j = 0; j < n; j += l) {
                for (int i = 0; i < m; i++) {
                    int x = a[i + j], y = a[i + j + m];
                    if (!rev) {
                        a[i + j] = (x + y) % p;
                        a[i + j + m] = (x - y + p) % p;
                    }
                    else {
                        a[i + j] = 1LL * (x + y) * inv2 % p;
                        a[i + j + m] = 1LL * (x - y + p) * inv2 % p;
                    }
                }
            }
        }
    }
    vector<int> Xor(vector<int> a1, vector<int> a2)
    {
        int n = max(a1.size(), a2.size()), N = extend(n);
        a1.resize(N), a2.resize(N);
        FWTxor(a1, 0), FWTxor(a2, 0);
        vector<int> A(N);
        for (int i = 0; i < N; i++) A[i] = 1LL * a1[i] * a2[i] % p;
        FWTxor(A, 1);
        return A;
    }
} fwt;
int n, m, k;
void solve()
{
    vector<int> f((1 << 20));
    vector<int> res((1 << 20));
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        string x;
        cin >> x;
        int s = 0;
        for (int j = 0; j < x.length(); j++) {
            if (x[j] == 'A') {
                s |= (1 << j);
            }
        }
        f[s] += 1;
    }
    vector<int> g = fwt.Xor(f, f);
    for (int i = 0; i < (1 << m);i++) {
        res[i] = g[i] / 2;
    }
    for (int j = 0; j < m;j++) {
        for (int i = 0; i < (1 << m);i++) {
            if(i>>j&1) {
                res[i] += res[i ^ (1 << j)];
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < (1 << m);i++) {
        if (n * n - res[i] * 2 >= k * 2) ans++;
    }
    cout << ans << endl;
}
signed main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int _ = 1;
    while (_--) {
        solve();
    }
    return 0;
}