#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double EPS = 1e-6;
long long s[1005][1005];
long long dp[1005][1005];
long long query(int a, int b, int c, int d) {
  return s[c][d] - s[c][b - 1] - s[a - 1][d] + s[a - 1][b - 1];
}
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  long long sum = 0LL;
  for (int r = 1; r <= n; r++)
    for (int c = 1; c <= m; c++) {
      int a;
      scanf("%d", &a);
      s[r][c] = s[r - 1][c] + s[r][c - 1] - s[r - 1][c - 1] + a;
      sum += (long long)a * max(0, k - abs(r - k) - abs(c - k));
    }
  pair<int, int> res = make_pair(k, k);
  dp[k][k] = sum;
  long long maxx = sum;
  for (int x = k; x <= n - k + 1; x++)
    for (int y = k; y <= m - k + 1; y++) {
      if (x == k) {
        if (y == k) continue;
        dp[x][y] = dp[x][y - 1];
        for (int i = 0; i < k; i++) {
          dp[x][y] += query(x - k + i + 1, y + i, x + k - i - 1, y + i);
          dp[x][y] -= query(x - k + i + 1, y - i - 1, x + k - i - 1, y - i - 1);
        }
      } else {
        dp[x][y] = dp[x - 1][y];
        for (int i = 0; i < k; i++) {
          dp[x][y] += query(x + i, y - k + i + 1, x + i, y + k - i - 1);
          dp[x][y] -= query(x - i - 1, y - k + i + 1, x - i - 1, y + k - i - 1);
        }
      }
      if (dp[x][y] > maxx) {
        maxx = dp[x][y];
        res = make_pair(x, y);
      }
    }
  printf("%d %d\n", res.first, res.second);
  return 0;
}
