#include <bits/stdc++.h>
using namespace std;
int n, m, k;
const long long mod = (long long)1e18 + 9;
string s[100005];
long long x[100005];
random_device rd;
mt19937_64 gen(rd());
uniform_int_distribution<> dis(1, (int)1e12);
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m >> k;
    for (int i = 1; i <= n; ++i)
        cin >> s[i];
    long long tot = 0;
    for (int i = 1; i <= n; ++i) {
        x[i] = dis(gen);
        tot = (tot + x[i]) % mod;
    }
    vector < vector <long long>> c(m + 1, vector<long long>(4, 0));
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < m; ++j) {
            c[j][s[i][j] - 'A'] = (c[j][s[i][j] - 'A'] + x[i]) % mod;
        }
    }
    for (int i = 1; i <= n; ++i) {
        long long now = 0;
        for (int j = 0; j < m; ++j) {
            now = (now + tot - c[j][s[i][j] - 'A'] + mod) % mod;
        }
        if (now == ((__int128)tot - x[i] + mod) % mod * k % mod) {
            cout << i << endl;
        }
    }
}