#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, c = getchar(), f = 0;
  for (; c > '9' || c < '0'; f = c == '-', c = getchar())
    ;
  for (; c >= '0' && c <= '9'; x = (x << 1) + (x << 3) + c - '0', c = getchar())
    ;
  return f ? -x : x;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + 48);
}
const int N = 2000 + 10;
int n, m, K, ansx, ansy;
long long ans, s[N][N];
int main() {
  n = read(), m = read(), K = read();
  for (int i = 1, _y = n; i <= _y; ++i)
    for (int j = 1, _y = m; j <= _y; ++j) s[i + j - 1][i - j + m] += read();
  for (int i = 1, _y = n + m - 1; i <= _y; ++i) {
    for (int j = 1, _y = n + m - 1; j <= _y; ++j) s[i][j] += s[i][j - 1];
    for (int j = 1, _y = n + m - 1; j <= _y; ++j) s[i][j] += s[i - 1][j];
  }
  for (int a = K, _y = n - K + 1; a <= _y; ++a)
    for (int b = K, _y = m - K + 1; b <= _y; ++b) {
      int x = a + b - 1, y = a - b + m;
      long long sum = 0;
      for (int i = 0, _y = K - 1; i <= _y; ++i)
        sum += s[x + i][y + i] - s[x - i - 1][y + i] - s[x + i][y - i - 1] +
               s[x - i - 1][y - i - 1];
      if (sum >= ans) ans = sum, ansx = a, ansy = b;
    }
  printf("%d %d\n", ansx, ansy);
}
