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 $*a*_{*i*, *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 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$, ). Next $*n*$ lines each contains $*m*$ integers: the $*j*$-th number on the $*i*$-th line equals $*a*_{*i*, *j*}$ ($0 ≤ *a*_{*i*, *j*} ≤ 10^{6}$).

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.