// Author: Klay Thompson
// Problem: A. The Fool
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 210;

int n, m, k;
string str, a[maxn][maxn];
pii p[maxn * maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  rep (i, 1, n) {
    cin >> str;
    rep (j, 1, m) {
      a[i][j] = str.substr((j - 1) * k, k);
    }
  }
  int tot = 0;
  rep (i, 1, n) rep (j, 1, m) p[++tot] = pii(i, j);
  sort(p + 1, p + tot + 1, [&](pii x, pii y) { return a[x.fi][x.se] < a[y.fi][y.se]; });
  if (a[p[1].fi][p[1].se] != a[p[2].fi][p[2].se]) cout << p[1].fi << " " << p[1].se << '\n';
  else cout << p[tot].fi << " " << p[tot].se << '\n';
}