#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int n, m, k;
int a[maxn][maxn];
long long lu[maxn][maxn], ru[maxn][maxn], u[maxn][maxn], val[maxn][maxn],
    ltr[maxn][maxn], rtr[maxn][maxn];
long long rleg(int i, int j, int len) {
  return (ru[i][j] - ru[i - len][j + len] + lu[i + len - 1][j + len - 1] -
          lu[i - 1][j - 1] - a[i][j]);
}
long long lleg(int i, int j, int len) {
  return (lu[i][j] - lu[i - len][j - len] + ru[i + len - 1][j - len + 1] -
          ru[i - 1][j + 1] - a[i][j]);
}
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", &a[i][j]);
  for (int i = (1); i <= (n); ++i)
    for (int j = (1); j <= (m); ++j) {
      lu[i][j] = lu[i - 1][j - 1] + a[i][j];
      ru[i][j] = ru[i - 1][j + 1] + a[i][j];
    }
  for (int i = (1); i <= (n); ++i)
    for (int j = (1); j <= (m); ++j) u[i][j] = u[i - 1][j] + a[i][j];
  for (int i = (k); i <= (n - k + 1); ++i) {
    for (int j = (1); j <= (k); ++j) {
      ltr[i][k] += rleg(i, j, k - j + 1);
    }
    for (int j = (k + 1); j <= (m - k + 1); ++j) {
      ltr[i][j] =
          ltr[i][j - 1] - rleg(i, j - k, k) + (u[i + k - 1][j] - u[i - k][j]);
    }
    for (int j = m; j >= m - k + 1; --j) {
      rtr[i][m - k + 1] += lleg(i, j, j - (m - k + 1) + 1);
    }
    for (int j = m - k; j >= k; --j)
      rtr[i][j] =
          rtr[i][j + 1] - lleg(i, j + k, k) + (u[i + k - 1][j] - u[i - k][j]);
  }
  for (int i = (k); i <= (n - k + 1); ++i) {
    for (int j = (1); j <= (k); ++j) val[i][k] += j * rleg(i, j, k - j + 1);
    for (int j = (k + 1); j <= (2 * k - 1); ++j)
      val[i][k] += (k - (j - k)) * lleg(i, j, j - k);
    for (int j = (k + 1); j <= (m - k + 1); ++j)
      val[i][j] = val[i][j - 1] - ltr[i][j - 1] + rtr[i][j];
  }
  int a = -1, b = -1;
  for (int i = (k); i <= (n - k + 1); ++i)
    for (int j = (k); j <= (m - k + 1); ++j)
      if (!~a || val[a][b] < val[i][j]) {
        a = i, b = j;
      }
  printf("%d %d\n", a, b);
  return 0;
}
