#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long sum[2005][2005], l[2005][2005], r[2005][2005];
long long px, py, mx = -1;
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      scanf("%d", &sum[i][j]);
      sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
    }
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= m; j++) {
      l[i][j] = (i > 0 ? l[i - 1][j + 1] : 0) + sum[i][j];
      r[i][j] = ((i > 0 && j > 0) ? r[i - 1][j - 1] : 0) + sum[i][j];
    }
  for (int i = k; i <= n - k + 1; i++)
    for (int j = k; j <= m - k + 1; j++) {
      long long tmp = l[i - 1][j - k] - (i > k ? l[i - k - 1][j] : 0);
      tmp += l[i + k - 1][j] - l[i - 1][j + k];
      tmp -= r[i - 1][j + k - 1] - (i > k ? r[i - k - 1][j - 1] : 0);
      tmp -= r[i + k - 1][j - 1] - (j > k ? r[i - 1][j - k - 1] : 0);
      if (tmp > mx) {
        mx = tmp;
        px = i;
        py = j;
      }
    }
  cout << px << " " << py << endl;
}
