#include <bits/stdc++.h>
const int N = 1e3 + 3;
int n, m, K, X, Y;
long long a[N << 1][N << 1], res, ans;
inline int Get() {
  char ch;
  while ((ch = getchar()) < '0' || ch > '9')
    ;
  int Num = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9')
    Num = (Num << 3) + (Num << 1) + ch - '0';
  return Num;
}
int main() {
  n = Get(), m = Get(), K = Get();
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) a[i + j - 1][i - j + m] += Get();
  for (int i = 1; i < n + m; ++i) {
    for (int j = 1; j < n + m; ++j) a[i][j] += a[i][j - 1];
    for (int j = 1; j < n + m; ++j) a[i][j] += a[i - 1][j];
  }
  for (int i = K; i <= n - K + 1; ++i)
    for (int j = K; j <= m - K + 1; ++j) {
      long long res = 0, x = i + j - 1, y = i - j + m;
      for (int k = 0; k < K; ++k)
        res += a[x + k][y + k] - a[x - k - 1][y + k] - a[x + k][y - k - 1] +
               a[x - k - 1][y - k - 1];
      if (res >= ans) ans = res, X = i, Y = j;
    }
  printf("%d %d\n", X, Y);
}
