// Mahmud Isali
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <bits/extc++.h>
using namespace std;
// using namespace __gnu_pbds;
// #define int long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const long long INF = 1e18, MOD = 1e9 + 9, N = 5e5 + 10;
void solve() {
int n,m,k;
cin >> n >> m >> k;
int AABB = 0, ABAB = 0, ABBA = 0;
vector<string> r;
vector<string> v(n + 1, "");
for(int i = 1; i <= n; i++) {
string s;
for(int i = 1; i <= m; i++) cin >> s;
v[i] = s;
}
auto sm = [&](int a, int b) {
return (r[a] == r[b]);
};
for(int i = 1; i <= n; i++) {
if(v[i].size() < k) {
int nxt = i - (i % 4) + 4;
i = nxt;
r.clear();
continue;
}
string made;
for(int j = v[i].size() - 1; j >= 0 && made.size() < k ;j--) {
made.pb(v[i][j]);
}
reverse(all(made));
r.pb(made);
if(r.size() == 4) {
if(sm(0,1) && sm(2,3)) AABB++;
if(sm(0,2) && sm(1,3)) ABAB++;
if(sm(0,3) && sm(1,2)) ABBA++;
r.clear();
}
}
cout << AABB << ' ' << ABAB << ' ' << ABBA << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin >> t;
for(int T = 1; T <= t; T++) {
solve();
}
}
