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

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int n, m, k; cin >> n >> m >> k;
    map<string, int> id;
    vector<array<int, 2>> pos(2);
    int cnt[2], cur = 0;
    for (int i = 0;i < n;i++) {
        string s; cin >> s;
        for (int j = 0;j < m * k;j += k) {
            string t = s.substr(j, k);
            if (id.find(t) == id.end()) {
                id[t] = cur;
                cnt[cur]++;
                pos[cur++] = {i, j / k};
            }
            else {
                cnt[id[t]]++;
                pos[id[t]] = {i, j / k};
            }
        }
    }
    if (cnt[0] == 1) {
        cout << pos[0][0] + 1 << " " << pos[0][1] + 1 << '\n';
    }
    else {
        cout << pos[1][0] + 1 << " " << pos[1][1] + 1 << '\n';
    }
}