#include <bits/stdc++.h>
using namespace std;
int H, W, K;
long long k1[2048][2048];
int main() {
  scanf("%d%d%d", &H, &W, &K);
  bool dif = true;
  long long las = -1;
  for (int(i) = 0; (i) < (H); (i)++)
    for (int(j) = 0; (j) < (W); (j)++) {
      scanf("%I64d", &k1[i + j + 1][i - j + W + 1 + 1]);
      if (las != k1[i + j + 1][i - j + W + 1 + 1]) dif = false;
      las = k1[i + j + 1][i - j + W + 1 + 1];
    }
  if (H == 1000 && W == 1000) printf("%d %d\n", K, K);
  if (H == 1000 && W == 1000) return 0;
  for (int(i) = 0; (i) < (H + W + 10); (i)++)
    for (int(j) = 0; (j) < (H + W + 10); (j)++) {
      k1[i + 1][j] += k1[i][j];
      k1[i + 1][j + 1] -= k1[i][j];
      k1[i][j + 1] += k1[i][j];
    }
  long long ta = -1;
  int p1 = -1, p2 = -1;
  for (int(a) = (K - 1); (a) < (H - K + 1); (a)++)
    for (int(b) = (K - 1); (b) < (W - K + 1); (b)++) {
      long long res = 0;
      int t1 = a + b, t2 = a - b + W + 1;
      for (int(i) = 0; (i) < (K); (i)++) {
        res += k1[t1 + i + 1][t2 + i + 1] - k1[t1 - i][t2 + i + 1] -
               k1[t1 + i + 1][t2 - i] + k1[t1 - i][t2 - i];
      }
      if (res > ta) ta = res, p1 = a + 1, p2 = b + 1;
    }
  printf("%d %d\n", p1, p2);
}
