#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long a[1001][1001];
long long f[1001][1001];
long long s[1002][1002][2];
long long g[1001][1001];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) scanf("%I64d", &a[i][j]);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      s[i][j][0] = s[i - 1][j - 1][0] + a[i][j],
      s[i][j][1] = s[i - 1][j + 1][1] + a[i][j];
      f[i][j] = a[i][j], g[i][j] = a[i][j];
    }
  for (int t = 1; t < k; t++)
    for (int i = k; i <= n - k + 1; i++)
      for (int j = k; j <= m - k + 1; j++) {
        g[i][j] += s[i][j + t][0] - s[i - t][j][0];
        g[i][j] += s[i][j - t][1] - s[i - t - 1][j + 1][1];
        g[i][j] += s[i + t][j][0] - s[i][j - t][0];
        g[i][j] += s[i + t - 1][j + 1][1] - s[i][j + t][1];
        f[i][j] += g[i][j];
      }
  int ta = k, tb = k;
  for (int i = k; i <= n - k + 1; i++)
    for (int j = k; j <= m - k + 1; j++)
      if (f[i][j] > f[ta][tb]) ta = i, tb = j;
  printf("%d %d\n", ta, tb);
  return 0;
}
