CODE FESTIVAL 2016 Final (Parallel)

A - Where's Snuke?


Time limit時間制限 : 2sec / Memory limitメモリ制限 : 256MB

配点 : 100

問題文

H 行、横 W 列のマス目があります。

上から i 行目、左から j 列目には長さ 5 の文字列 S_i_j が書かれています。

行には上から順に 1~H の番号が、列には左から順に A~Z の番号がついています。

この中から snuke という文字列を探し、列と行の番号を順に続けて出力してください。

例えば 6 行目の 8 列目にあった場合は、H6 のように出力してください。

制約

  • 1≦H, W≦26
  • S_i_j は小文字アルファベット(a-z)のみからなる長さ 5 の文字列である。
  • 与えられる文字列のうち、ちょうど 1 つだけが snuke である。

入力

入力は以下の形式で標準入力から与えられる。

H W
S_1_1 S_1_2 ... S_1_W
S_2_1 S_2_2 ... S_2_W
:
S_H_1 S_H_2 ... S_H_W

出力

snuke という文字列が書かれているマスの列と行の番号を続けて出力せよ。


入力例 1

15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake

出力例 1

H6

入力例 2

1 1
snuke

出力例 2

A1

Score : 100 points

Problem Statement

There is a grid with H rows and W columns.

The square at the i-th row and j-th column contains a string S_i_j of length 5.

The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.

Exactly one of the squares in the grid contains the string snuke. Find this square and report its location.

For example, the square at the 6-th row and 8-th column should be reported as H6.

Constraints

  • 1≦H, W≦26
  • The length of S_i_j is 5.
  • S_i_j consists of lowercase English letters (a-z).
  • Exactly one of the given strings is equal to snuke.

Input

The input is given from Standard Input in the following format:

H W
S_1_1 S_1_2 ... S_1_W
S_2_1 S_2_2 ... S_2_W
:
S_H_1 S_H_2 ... S_H_W

Output

Print the labels of the row and the column of the square containing the string snuke, with no space inbetween.


Sample Input 1

15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake

Sample Output 1

H6

Sample Input 2

1 1
snuke

Sample Output 2

A1

Submit提出する