#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
long long s[1010][1010], s1[1010][1010], s2[1010][1010];
int n, m, K, x;
int main() {
  scanf("%d%d%d", &n, &m, &K);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      scanf("%d", &x),
          s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + x;
  for (int i = 1; i <= n; ++i)
    for (int j = 0; j <= m; ++j) {
      s1[i][j] = s1[i - 1][j + 1] + s[i][j] -
                 (i >= K && j + K <= m ? s[i - K][j + K] : 0);
      if (j)
        s2[i][j] = s2[i - 1][j - 1] + s[i][j] -
                   (i >= K && j >= K ? s[i - K][j - K] : 0);
    }
  long long maxx = -1;
  int ansx, ansy;
  for (int i = K; i <= n - K + 1; ++i)
    for (int j = K; j <= m - K + 1; ++j) {
      long long value = s1[i + K - 1][j] + s1[i - 1][j - K] -
                        s2[i + K - 1][j - 1] - s2[i - 1][j + K - 1];
      if (value > maxx) {
        maxx = value;
        ansx = i;
        ansy = j;
      }
    }
  printf("%d %d\n", ansx, ansy);
}
