#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1005;
int n, m, k;
long long s[Maxn][Maxn], sl[Maxn][Maxn], sr[Maxn][Maxn];
inline int get() {
  char ch;
  while (!isdigit(ch = getchar()))
    ;
  int v = ch - 48;
  while (isdigit(ch = getchar())) v = v * 10 + ch - 48;
  return v;
}
int main() {
  n = get();
  m = get();
  k = get();
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      s[i][j] = get() + s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      sl[i][j] =
          sl[i - 1][j - 1] + s[i][j] - (i > k && j > k ? s[i - k][j - k] : 0);
      sr[i][j] = sr[i - 1][j + 1] + s[i][j] -
                 (i > k && j + k <= m ? s[i - k][j + k] : 0);
    }
    sr[i][0] = sr[i - 1][1] + s[i][0] - (i > k ? s[i - k][k] : 0);
  }
  int wx = 0, wy = 0;
  long long maxv = -1;
  for (int i = k; i <= n - k + 1; i++)
    for (int j = k; j <= m - k + 1; j++) {
      long long v = sr[i + k - 1][j] + sr[i - 1][j - k] - sl[i - 1][j + k - 1] -
                    sl[i + k - 1][j - 1];
      if (maxv < v) maxv = v, wx = i, wy = j;
    }
  cout << wx << ' ' << wy << endl;
  return 0;
}
