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

#define ll long long 
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>

#define N (1<<21) 

template<typename T> 
struct FWT {
    int n;

    void Xor(T* a, bool inv=0) {
        T t = !inv ? T(1) : T(2);
        for (int i = 2; i <= n; i <<= 1) {
            int h = i >> 1;
            for (int j = 0; j < n; j += i) {
                for (int k = 0; k < h; ++ k) {
                    a[j+k] = a[j+k] + a[j+k+h];
                    a[j+k+h] = a[j+k] - a[j+k+h] - a[j+k+h];
                    a[j+k] = a[j+k] / T(t);
                    a[j+k+h] = a[j+k+h] / T(t);
                }
            }
        }
    }
};


FWT<ll> fwt;
ll cnt[N], dp[N];

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m, k; cin >> n >> m >> k;
    int msk = (1<<m)-1;

    for (int i = 0; i < n; ++ i) {
        string s; cin >> s;
        int cur = 0;
        for (int j = 0; j < m; ++ j) cur |= ((s[j] == 'A') << j);
        cnt[cur] ++;
    }

    fwt.n = 1<<m;
    fwt.Xor(cnt);
    for (int i = 0; i < (1<<m); ++ i) cnt[i] *= cnt[i];
    fwt.Xor(cnt, 1);

    for (int i = 0; i < (1<<m); ++ i) dp[i] = cnt[i];
    for (int i = 1; i < (1<<m); ++ i) {
        int msb = 1<<(31-__builtin_clz(i));
        int lsb = (i&-i);

        if (msb == lsb) dp[i] += dp[i-lsb];
        else dp[i] += dp[i-lsb] + dp[i-msb] - dp[i-lsb-msb];
    }

    int res = 0;
    for (int i = 0; i < (1<<m); ++ i) res += (1ll * n * n - dp[msk^i]) >= 2ll * k;

    cout << res << '\n';
}