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

#define int long long  

void FWT(vector<int> &a, bool inv) {
    for (int n = a.size(), step = 1; step < n; step *= 2) {
        for (int i = 0; i < n; i += 2 * step) {
            for (int j = i; j < i + step; j++) {
                int &u = a[j], &v = a[j + step]; 
                // tie(u, v) = inv ? pair(v - u, u) : pair(v, u + v); // AND
                // tie(u, v) = inv ? pair(v, u - v) : pair(u + v, u); // OR
                tie(u, v) = pair(u + v, u - v); // XOR
            }
        }
    }
    if (inv) {
        for (auto &x : a) {
            x /= a.size(); // XOR only
        }
    }
}
vector<int> conv(vector<int> a, vector<int> b) {
    FWT(a, false); 
    FWT(b, false);
    for (int i = 0; i < a.size(); i++) {
        a[i] *= b[i];
    }
    FWT(a, true);
    return a;
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n, m, k;
	cin >> n >> m >> k;

	vector<int> a(n + 1);
	vector<int> x(1LL << m);
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < m; j++) {
			char c;
			cin >> c;
			if (c == 'A') {
				a[i] |= (1LL << j);
			}
 		}
 		x[a[i]]++;
	}

	auto f = conv(x, x);
	f[0] -= n;
	for (int i = 0; i < (1LL << m); i++) {
		f[i] /= 2;
	}
	
	auto g = f;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < (1LL << m); j++) {
			if (j >> i & 1) {
				g[j] += f[j ^ (1LL << i)];
			}
		}
	}

	int ans = 0;
	for (int i = 1; i < (1LL << m); i++) {
		int x = i;
		for (int j = 0; j < m; j++) {
			x ^= (1LL << j);
		}
		if (n * (n - 1) / 2 - g[x] >= k) {
			ans++;
		}
	}

	cout << ans << "\n";

    return 0;
}