#include <bits/stdc++.h>
using namespace std;
long long f[2005][2005];
long long work(int u, int x, int v, int y) {
  return f[v][y] - f[v][x - 1] - f[u - 1][y] + f[u - 1][x - 1];
}
int main() {
  long long c = -1, s;
  int n, m, t, i, j, k, l;
  scanf("%d%d%d", &n, &m, &t);
  for (k = 0; k < n; k++) {
    for (i = m + k, j = 1 + k; i > k; i--, j++) scanf("%I64d", &f[i][j]);
  }
  for (i = 1; i <= n + m; i++) {
    for (j = 1; j <= n + m; j++)
      f[i][j] += f[i][j - 1] + f[i - 1][j] - f[i - 1][j - 1];
  }
  int u, v;
  for (k = t - 1; k <= n - t; k++) {
    for (i = m + k - t + 1, j = t + k; i >= k + t; i--, j++) {
      s = 0;
      for (l = 0; l < t; l++) s += work(i - l, j - l, i + l, j + l);
      if (c < s) {
        c = s;
        u = k + 1;
        v = j - k;
      }
    }
  }
  printf("%d %d\n", u, v);
  return 0;
}
