#include <bits/stdc++.h>
int x, y, k, ansx, ansy;
long long a[1111][1111], sum1[1111][1111], sum2[1111][1111], ans = -1, t;
long long s1(int xx, int yy) {
  if (xx < 1) return 0;
  if (yy < 1) return sum1[xx - 1][yy + 1];
  if (yy > y) return sum1[xx - 1][yy - 1];
  return sum1[xx][yy];
}
long long s2(int xx, int yy) {
  if (xx < 0) return 0;
  if (yy < 0) return sum2[xx - 1][yy + 1];
  if (yy > y) return sum2[xx - 1][yy - 1];
  return sum2[xx][yy];
}
long long square(int a, int b, int c) {
  return sum1[a + c][b] - sum2[a - 1][b - c - 1] - sum2[a - 1][b + c] +
         sum1[a - c - 1][b];
}
int main() {
  int i, j, l;
  memset(a, 0, sizeof(a));
  memset(sum1, 0, sizeof(sum1));
  memset(sum2, 0, sizeof(sum2));
  scanf("%d%d%d", &x, &y, &k);
  for (i = 1; i <= x; i++)
    for (j = 1; j <= y; j++) scanf("%d", &a[i][j]);
  for (i = 1; i <= x; i++)
    for (j = 1; j <= y; j++)
      sum1[i][j] = s1(i - 1, j - 1) + s1(i - 1, j + 1) - s1(i - 2, j) +
                   a[i - 1][j] + a[i][j];
  for (i = 1; i <= x; i++)
    for (j = 0; j <= y; j++)
      sum2[i][j] = s2(i - 1, j - 1) + s2(i - 1, j + 1) - s2(i - 2, j) +
                   a[i][j] + a[i][j + 1];
  for (i = k; i <= x + 1 - k; i++)
    for (j = k; j <= y + 1 - k; j++) {
      t = 0;
      for (l = 0; l < k; l++) t += square(i, j, l);
      if (ans < t) {
        ans = t;
        ansx = i;
        ansy = j;
      }
    }
  printf("%d %d\n", ansx, ansy);
  return 0;
}
