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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), m = in.nextInt(), k = in.nextInt();

            int[][] A = new int[n + 2][m + 2];
            int[][] d1 = new int[n + 2][m + 2];
            int[][] d2 = new int[n + 2][m + 2];
            int[][] r1 = new int[n + 2][m + 2];
            int[][] r2 = new int[n + 2][m + 2];
            int[][] up = new int[n + 2][m + 2];
            long[][] tleft = new long[n + 2][m + 2];
            long[][] tright = new long[n + 2][m + 2];

            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= m; ++j) {
                    A[i][j] = in.nextInt();
                    d1[i][j] = d1[i - 1][j - 1] + A[i][j];
                    up[i][j] = up[i - 1][j] + A[i][j];
                }
                for (int j = m; j > 0; --j) {
                    r1[i][j] = r1[i - 1][j + 1] + A[i][j];
                }
            }

            for (int i = n; i > 0; --i) {
                for (int j = 1; j <= m; ++j) {
                    d2[i][j] = d2[i + 1][j - 1] + A[i][j];
                }
                for (int j = m; j > 0; --j) {
                    r2[i][j] = r2[i + 1][j + 1] + A[i][j];
                }
            }

            k--;

            for (int i = k + 1; i <= n - k; ++i) {
                for (int j = 1; j <= m; ++j) {
                    tleft[i][j] = tleft[i][j - 1];
                    tleft[i][j] += up[i + k][j] - up[i - k - 1][j];
                    tleft[i][j] -= d1[i + k][j - 1];
                    tleft[i][j] -= d2[i - k][j - 1];
                    if (j - k - 1 >= 0) {
                        tleft[i][j] += d1[i][j - k - 1];
                        tleft[i][j] += d2[i][j - k - 1];
                        tleft[i][j] -= A[i][j - k - 1];
                    }
                }
                for (int j = m; j > 0; --j) {
                    tright[i][j] += tright[i][j + 1];
                    tright[i][j] += up[i + k][j] - up[i - k - 1][j];
                    tright[i][j] -= r1[i + k][j + 1];
                    tright[i][j] -= r2[i - k][j + 1];
                    if (j + k + 1 <= m) {
                        tright[i][j] += r1[i][j + k + 1];
                        tright[i][j] += r2[i][j + k + 1];
                        tright[i][j] -= A[i][j + k + 1];
                    }
                }
            }

            long ans = -1;
            int fi = -1, fj = -1;
            for (int i = k + 1; i <= n - k; ++i) {
                long sum = 0;
                for (int l = i - k, d = 1, p = k + 1; l <= i; ++l, ++d, --p) {
                    long cr = r2[l][1] - r2[i][p];
                    cr += r1[2 * i - l][1] - r1[i][p];
                    cr += A[i][p];
                    cr *= d;
                    sum += cr;
                }
                for (int j = 1; j <= m - k; ++j) {
                    if (j > 1) {
                        sum += tright[i][j];
                        sum -= tleft[i][j - 1];
                    }
                    if (j >= k + 1) {
                        if (ans < sum) {
                            ans = sum;
                            fi = i;
                            fj = j;
                        }
                    }
                }
            }

            out.println(fi + " " + fj);
            //System.err.println(ans);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}