#include <bits/stdc++.h>
const long long N = 1005;
long long n, m, k, a[N][N], s1[N][N], s2[N][N], x, y, ans;
signed main() {
  scanf("%d%d%d", &n, &m, &k);
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= m; j++) scanf("%lld", &a[i][j]);
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= m; j++) a[i][j] += a[i - 1][j];
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= m; j++) a[i][j] += a[i][j - 1];
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= m; j++) s1[i][j] = a[i][j] + s1[i - 1][j - 1];
  for (long long i = n; i >= k; i--)
    for (long long j = k; j <= m; j++) s1[i][j] -= s1[i - k][j - k];
  for (long long i = 1; i <= n; i++)
    for (long long j = m; j >= 0; j--) s2[i][j] = a[i][j] + s2[i - 1][j + 1];
  for (long long i = n; i >= k; i--)
    for (long long j = 0; j <= m - k + 1; j++) s2[i][j] -= s2[i - k][j + k];
  for (long long i = k; i <= n - k + 1; i++)
    for (long long j = k; j <= m - k + 1; j++) {
      long long val = s2[i + k - 1][j] + s2[i - 1][j - k] -
                      s1[i + k - 1][j - 1] - s1[i - 1][j + k - 1];
      if (val >= ans) ans = val, x = i, y = j;
    }
  printf("%lld %lld\n", x, y);
}
