A geographic map is given as a grid of R rows and C columns.
In a small country, each village is marked with the lowercase letter x. Each village name is a contiguous string of uppercase English letters written in one row and read from left to right.
A village name is written next to the village it belongs to. More precisely, at least one character of the name is in one of the eight cells adjacent to the village cell.
Several names may be near one village, and several villages may be near one name. However, the given map always makes it possible to determine each village's position and name.
Write a program that finds every village's position and name.
The first line contains the number of rows R and columns C. (1 ≤ R ≤ 50, 1 ≤ C ≤ 50)
Each of the next R lines contains a length-C string describing the map. Each character is ., x, or an uppercase English letter.
All village names are distinct. If multiple village names appear in the same row, every pair of adjacent names is separated by at least one . or x.
Print each village's row number, column number, and name on its own line. Rows are numbered from 1 to R from top to bottom, and columns are numbered from 1 to C from left to right.
If there are several valid ways to determine a village's name, you may print any one of them. The output order may be arbitrary.