#include <bits/stdc++.h>
using namespace std;
int N, M, K, Ansx, Ansy;
long long Max, A[1001][1001], Sum[1001][1001];
void Print() { printf("%d %d\n", Ansx, Ansy); }
inline long long Count(int x1, int y1, int x2, int y2) {
  return Sum[x2][y2] + Sum[x1 - 1][y1 - 1] - Sum[x2][y1 - 1] - Sum[x1 - 1][y2];
}
void Solve() {
  int im = N - K + 1, jm = M - K + 1;
  for (int i = K; i <= im; ++i)
    for (int j = K; j <= jm; ++j) {
      long long tmp = 0;
      for (int k = 1; k <= K; ++k)
        tmp += Count(i - K + k, j - k + 1, i + K - k, j + k - 1);
      if (tmp >= Max) Max = tmp, Ansx = i, Ansy = j;
    }
}
void Init() {
  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) A[i][j] += A[i - 1][j];
  for (int i = 1; i <= N; ++i)
    for (int j = 1; j <= M; ++j) Sum[i][j] = Sum[i][j - 1] + A[i][j];
}
int main() {
  Init();
  Solve();
  Print();
  return 0;
}
