A. Finding Bo
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vivian needs us to pick up her Golden Retriever, Bo, from a dog park filled with Corgis. However, we're not good at identifying dog breeds, and she only told us that Bo is the tallest dog at the park. The dog park is represented as a 2D grid, where a '.' denotes an empty space and any nonzero digit $$$h$$$ represents a dog at that position with height $$$h$$$. The height of each dog is indicated by a single-digit positive integer.

Write a program to assist Vivian in finding Bo by determining the row and column number of the tallest dog in the park. The park is guaranteed to have at least one dog, and there is guaranteed to be a unique tallest dog.

Input

The first line contains two integers, $$$N$$$ and $$$M\ (1 \leq N, M \leq 100)$$$, representing the number of rows and number of columns, respectively, in the dog park.

The next $$$N$$$ lines contain $$$M$$$ characters each, representing the 2D grid of the dog park. Each character is either '.' (empty space) or a non-zero digit (1-9) representing a dog's height.

Output

Output two integers, separated by a single space, representing the row and column number of the tallest dog, Bo.

Example
Input
7 7
..6..2.
65...55
...7.2.
.......
....26.
.....1.
2...5..
Output
3 4
Note

Bo, being the tallest dog, has height 7, and is in the $$$3^\text{rd}$$$ row and $$$4^\text{th}$$$ column.