Problem: You've got a table of size n × m. On the intersection of the i-th row (1 ≤ i ≤ n) and the j-th column (1 ≤ j ≤ m) there is a non-negative integer ai, j. Besides, you've got a non-negative integer k.

Your task is to find such pair of integers (a, b) that meets these conditions: 

  * k ≤ a ≤ n - k + 1; 
  * k ≤ b ≤ m - k + 1; 
  * let's denote the maximum of the function <image> among all integers x and y, that satisfy the inequalities k ≤ x ≤ n - k + 1 and k ≤ y ≤ m - k + 1, as mval; for the required pair of numbers the following equation must hold f(a, b) = mval. 

Input

The first line contains three space-separated integers n, m and k (1 ≤ n, m ≤ 1000, <image>). Next n lines each contains m integers: the j-th number on the i-th line equals ai, j (0 ≤ ai, j ≤ 106).

The numbers in the lines are separated by spaces.

Output

Print the required pair of integers a and b. Separate the numbers by a space.

If there are multiple correct answers, you are allowed to print any of them.

Examples

Input

4 4 2
1 2 3 4
1 1 1 1
2 2 2 2
4 3 2 1


Output

3 2


Input

5 7 3
8 2 3 4 2 3 3
3 4 6 2 3 4 6
8 7 6 8 4 5 7
1 2 3 2 1 3 2
4 5 3 2 1 2 1


Output

3 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int maxn = 1111;
long long a[maxn][maxn];
long long f[maxn][maxn];
long long g[maxn][maxn];
long long h[maxn][maxn];
long long s[maxn][maxn];
long long left[maxn][maxn];
long long right[maxn][maxn];
long long sum[maxn][maxn];
long long r[maxn][maxn];
int n, m;
void output(long long arr[maxn][maxn]) {
  puts("==============");
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      printf("%I64d ", arr[i][j]);
    }
    puts("");
  }
  puts("==============");
}
void go(int k) {
  for (int i = k; i <= n - k + 1; ++i) {
    for (int j = k; j <= m - k + 1; ++j) {
      for (int p = 1; p <= n; ++p) {
        for (int q = 1; q <= m; ++q) {
          int d = k - abs(p - i) - abs(q - j);
          if (d > 0) r[i][j] += a[p][q] * d;
        }
      }
    }
  }
  output(r);
}
int main() {
  int i, j, k;
  scanf("%d%d%d", &n, &m, &k);
  int ansx, ansy;
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= m; ++j) {
      scanf("%I64d", a[i] + j);
    }
  }
  if (k == 1) {
    ansx = ansy = 1;
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= m; ++j) {
        if (a[ansx][ansy] < a[i][j]) {
          ansx = i;
          ansy = j;
        }
      }
    }
    printf("%d %d\n", ansx, ansy);
    return 0;
  }
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= m; ++j) {
      s[i][j] = s[i - 1][j] + a[i][j];
      f[i][j] = f[i - 1][j + 1] + a[i][j];
      g[i][j] = g[i - 1][j - 1] + a[i][j];
    }
  }
  int x, y, d;
  x = y = k;
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= m; ++j) {
      d = k - abs(i - x) - abs(j - y);
      if (d > 0) {
        if (j <= y)
          left[x][y] += a[i][j];
        else
          right[x][y] += a[i][j];
      }
    }
  }
  for (i = k, j = k; i <= n - k + 1; ++i) {
    x = i, y = k;
    sum[x][y] = k * a[i][k];
    for (j = 1; j < k; ++j) {
      long long tmp = 0;
      tmp += f[x][y - j] - f[x - j][y];
      tmp += g[x + j][y] - g[x][y - j];
      tmp += f[x + j][y] - f[x][y + j];
      tmp += g[x][y + j] - g[x - j][y];
      tmp = tmp - a[x + j][y] + a[x - j][y];
      tmp *= (k - j);
      sum[x][y] += tmp;
    }
  }
  for (i = k + 1, j = k; i <= n - k + 1; ++i) {
    x = i - 1, y = k;
    left[i][j] = left[x][y];
    right[i][j] = right[x][y];
    left[i][j] -= f[x][y - k + 1] - f[x - k][y + 1];
    right[i][j] -= g[x][y + k - 1] - g[x - k + 1][y];
    x = i, y = k;
    left[i][j] += g[x + k - 1][y] - g[x - 1][y - k];
    right[i][j] += f[x + k - 2][y + 1] - f[x - 1][y + k];
  }
  for (i = k; i <= n - k + 1; ++i)
    for (j = k + 1; j <= m - k + 1; ++j) {
      x = i, y = j - 1;
      left[i][j] = left[x][y];
      sum[i][j] = sum[x][y];
      right[i][j] = right[x][y];
      sum[i][j] -= left[i][j];
      left[i][j] -= f[x][y - k + 1] - f[x - k + 1][y];
      left[i][j] -= g[x + k - 1][y] - g[x][y - k + 1];
      left[i][j] -= a[x - k + 1][y];
      x = i, y = j;
      right[i][j] += g[x][y + k - 1] - g[x - k + 1][y];
      right[i][j] += f[x + k - 1][y] - f[x][y + k - 1];
      right[i][j] += a[x - k + 1][y];
      sum[i][j] += right[i][j];
      right[i][j] -= s[x + k - 1][y] - s[x - k][y];
      left[i][j] += s[x + k - 1][y] - s[x - k][y];
    }
  ansx = ansy = k;
  for (i = k; i <= n - k + 1; ++i) {
    for (j = k; j <= m - k + 1; ++j) {
      if (sum[ansx][ansy] < sum[i][j]) {
        ansx = i, ansy = j;
      }
    }
  }
  printf("%d %d\n", ansx, ansy);
  return 0;
}