#include <bits/stdc++.h>
using namespace std;
long long S[1005][1005], L[1005][1005], R[1005][1005];
int n, m, k, x, y;
long long tmp, ans;
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 + 1; i++)
    for (int j = 0; j <= m + 1; j++) {
      L[i][j] = L[i - 1][j + 1] + S[i][j];
      if (j) R[i][j] = R[i - 1][j - 1] + S[i][j];
    }
  ans = -1;
  for (int i = k; i <= n - k + 1; i++)
    for (int j = k; j <= m - k + 1; j++) {
      tmp = L[i + k - 1][j] - L[i - 1][j + k];
      tmp += L[i - 1][j - k] - (i > k ? L[i - k - 1][j] : 0);
      tmp -= R[i + k - 1][j - 1] - (j > k ? R[i - 1][j - k - 1] : 0);
      tmp -= R[i - 1][j + k - 1] - (i > k ? R[i - k - 1][j - 1] : 0);
      if (tmp > ans) {
        ans = tmp;
        x = i;
        y = j;
      }
    }
  printf("%d %d\n", x, y);
}
