#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
const int maxn = 2010;
int a[maxn][maxn];
int b[maxn][maxn];
long long d[maxn][maxn];
int k;
inline long long sum(int i1, int j1, int i2, int j2) {
  return d[i2][j2] - d[i1 - 1][j2] - d[i2][j1 - 1] + d[i1 - 1][j1 - 1];
}
long long tmp[maxn];
inline long long calc(int i, int j) {
  for (int t = 0; t < k; ++t) {
    tmp[t] = sum(i - t, j - t, i + t, j + t);
  }
  long long res = 0;
  for (int t = k - 1; t > 0; --t) {
    tmp[t] -= tmp[t - 1];
  }
  for (int t = 0; t < k; ++t) res += (k - t) * tmp[t];
  return res;
}
int main() {
  int nn, mm;
  scanf("%d%d%d", &nn, &mm, &k);
  for (int i = 1; i <= nn; ++i)
    for (int j = 1; j <= mm; ++j)
      scanf("%d", &b[i][j]), a[i + j][i - j + mm] = b[i][j];
  int n = nn + mm;
  int m = nn + mm;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      d[i][j] = a[i][j] + d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1];
  long long bestval = -1;
  int besti = -1;
  int bestj = -1;
  for (int i = k; i <= nn - k + 1; ++i)
    for (int j = k; j <= mm - k + 1; ++j) {
      long long curval = calc(i + j, i - j + mm);
      if (curval > bestval) {
        bestval = curval;
        besti = i;
        bestj = j;
      }
    }
  printf("%d %d\n", besti, bestj);
  return 0;
}
