A. The Fool
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output
"This place tastes like many emotions. Excitement, anger, joy and... salty? Is salty a feeling?"
— Neeko, The Curious Chameleon

Hailing from a long lost tribe of vastaya, Neeko can blend into any crowd by borrowing the appearances of others, even absorbing something of their emotional state to tell friend from foe in an instant. No one is ever sure where — or who — Neeko might be, but those who intend to do her harm will soon witness her true colors revealed, and feel the full power of her primordial spirit magic unleashed upon them.

Source: https://bilibili.com/BV1ub421e7cd/

Neeko has infiltrated a grid of characters with dimensions $$$n \times m$$$, each cell in the grid is represented by a string of length $$$k$$$. She can mimic the other cells; however, Neeko's cell has at least one character different from the other cells while all the other cells are the same. Your task is to find Neeko.

Input

The first line of the input contains three integers $$$n, m, k ~(2 \leq n, m \leq 200, 1 \leq k \leq 10)$$$.

The next $$$n$$$ lines contain $$$m \cdot k$$$ characters each, consisting of visible ASCII characters from !(33) to  (126). The $$$((j - 1) \cdot k + 1)$$$-th to the $$$(j \cdot k)$$$-th character in the $$$i$$$-th line represents the cell $$$(i, j)$$$.

It's guaranteed that there is no extra space or line break, and the answer can be uniquely determined.

Output

Print two integers $$$r, c$$$, denoting the position of Neeko is in the $$$r$$$-th row and the $$$c$$$-th column.

Example
Input
3 5 3
QWQQWQQWQQWQQWQ
QWQQWQQWQQWQQWQ
QWQQWQQWQQWQQwQ
Output
3 5