Problem:


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



Sample input:
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:
H6

Submission status: Wrong Answer

Solution code:
from string import *
h,w=map(int,input().split())

s=[list(map(str, input().split())) for i in range(h)]

for i in range(h):
    for j in range(w):
        if(s[i][j]=='snuke'):
            idx1=ascii_lowercase[i].swapcase()
            idx2=str(j+1)
            print(idx1+idx2)
            exit()

Submission status: Wrong Answer

Solution code:
from string import *
h,w=map(int,input().split())

s=[None]*h
for i in range(h):
    s[i] = [None]*w
    for j in range(w):
        if(s[i][j]=='snuke'):
            idx1=ascii_lowercase[i].swapcase()
            idx2=str(j+1)
            print(idx1+idx2)
            exit()

Submission status: Wrong Answer

Solution code:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Submission status: Wrong Answer

Solution code:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( i + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Submission status: Wrong Answer

Solution code:
# CODE FESTIVAL 2016 Final: A – Where's Snuke?
h, w = [int(s) for s in input().split()]
s = [[s for s in input().split()] for _ in range(h)]
characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

for i in range(h + 1):
    if 'snuke' in s[i]:
        print(characters[i] + str(s[i].index('snuke') + 1))
        break

Submission status: Wrong Answer

Solution code:
#Where's Snuke?
H, W = map(int, input().split())
ab = [chr(ord('A') + i) for i in range(26)]
for i in range(H):
    S = input().split()
    for j in range(W):
        if S[j] == "snuke":
            print(ab[i]+str(i+1)) 
            break
        break

Submission status: Wrong Answer

Solution code:
h,w=map(int,input().split())
l=[list(input().split()) for _ in range(h)]
print(l)
for i in range(h):
    for j in range(w):
        if l[i][j]=="snuke":
            print(str(chr(ord("A")+j))+str(i+1))
            exit()

Submission status: Wrong Answer

Solution code:
print(1)
print(2)
print(3)

Submission status: Wrong Answer

Solution code:
H,W = map(int,input().split())

answer = ''
for row in range(H):
  for col,s in enumerate(input().split()):
    if s == 'snuke':
      answer = chr(ord('A')+col) + str(row)

print(answer)

Submission status: Wrong Answer

Solution code:
H, W = map(int, input().split())
S = [list(input().split()) for _ in range(H)]
for i in range(H):
	for j in range(W):
		if S[i][j] == "snuke":
			print(chr(97 + i).upper() + str(j + 1))
			exit()

Submission status: Wrong Answer

Solution code:
H,W = map(int,input().split())
col = "ABCDEFGHIJKLMNOPQRSTAUVWXYZ"
for i in range(H):
    s = list(map(str,input().split()))
    if "snuke" in s:
        j = s.index("snuke")
        ans = col[j] + str(i+1)
print(ans)

Submission status: Wrong Answer

Solution code:
h,w=map(int,input().split())
for i in range(h):
  a=input()
  if 'snuke' in a:
    b=a.find('snuke')
    break
print(chr(ord('A')+b)+str(i+1))

Submission status: Wrong Answer

Solution code:
from itertools import product

H, W = map(int, input().split())
L = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
S = [[str(_) for _ in input().split()] for _ in range(H)]

for i, j in product(range(H), range(W)):
    if S[i][j] == "snuke":
        break

res = L[i] + str(j+1)
print(res)

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
k = []
for i in range(N):
  t = list(map(str, input().split()))
  for j in range(M):
    if t[j] == "snuke":p = [i,j]
abc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
print(abc[p[1]]+str(p[0]))

Submission status: Wrong Answer

Solution code:
h,w=map(int,input().split())
q=[list(map(str,input().split()))for i in range(h)]
p=["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
for i in range(h):
    for j in range(w):
        if q[i][j]=="snuke":
            print(p[i]+str(j+1))

Submission status: Wrong Answer

Solution code:
H, W = list(map(int, input().split()))
S = [input().split() for i in range(H)]

for i in range(H):
    for j in range(W):
        if S[i][j] == 'snuke':
            ans = [chr(i) for i in range(97, 97+26)][j] + str(i + 1)
            break


print(ans)

Submission status: Wrong Answer

Solution code:
h,w=map(int,input().split())
a=[input().split() for _ in range(h)]
for i in range(h):
  for j in range(w):
    if(a[i][j]=="sunuke"):
      print(chr(65+j)+str(i+1))

Submission status: Wrong Answer

Solution code:
H,M=map(int,input().split())
c=0
for i in range(H):
    S=input().split()
    for j in range(0,M):
        if S[j]=="snuke":
            a=i
            b=j
        else:
            c+=1

print(chr(ord('A')+a) + str(b+1))

Submission status: Wrong Answer

Solution code:
h, w = map(int, input().split())
S = [input().split() for _ in range(h)]
for i in range(h):
    for j in range(w):
        if S[i][j] == 'snuke':
            print(chr(i+65) + str(j+1))

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
s=[input().split() for i in range(a)]
al='abcdefghijklnopqrstuvwxyz'
for j,i in enumerate(s):
    if 'snuke' in i:
        print(al[i.index('snuke')].upper()+str(j+1))

Submission status: Wrong Answer

Solution code:
from string import ascii_uppercase
  
def row_label(i):
    return str(i + 1)

def col_label(j):
    return ascii_uppercase[j]

def solve(s_list):
    for (i, j) in zip(range(h), range(w)):
        if s_list[i][j] == 'snuke':
            return col_label(j) + row_label(i)

if __name__ == '__main__':
    (h, w) = (int(_) for _ in input().split())
    s_list = [list(input().split()) for _ in range(h)]
    print(solve(s_list))

Submission status: Wrong Answer

Solution code:
import string
H, W = map(int, input().split())
a = []
for i in range(H):
    a.append(input().split())

for i in range(H):
    for j in range(W):
        if a[i][j] == 'snuke':
            print(string.ascii_lowercase[j]+str(i+1))
            break

Submission status: Wrong Answer

Solution code:
ALPHA_BET = "ABCDEFGHIJKLMNOPQESTUVWXYZ"

def solve():
	H, W = list(map(int, input().split()))
	for i in range(H):
		line = input().split()
		for j, s in enumerate(line):
			if s == "snuke":
				print(ALPHA_BET[j] + str(i+1))
				return
		
solve()

Submission status: Wrong Answer

Solution code:
ALPHA_BET = "ABCDEFGHIJKLMNOPQESTUVWXYZ"
 
def solve():
	H, W = list(map(int, input().split()))
	for i in range(H):
		line = input().split()
		for j, s in enumerate(line):
			if s == "snuke":
				print(ALPHA_BET[j] + str(i))
				return

solve()

Submission status: Wrong Answer

Solution code:
ALPHA_BET = "ABCDEFGHIJKLMNOPQESTUVWXYZ"

def solve():
	H, W = list(map(int, input().split()))
	for i in range(H):
		line = input().split()
		for j, s in enumerate(line):
			if s == "snuke":
				print(ALPHA_BET[j] + str(i))
				return
		

solve()

Submission status: Wrong Answer

Solution code:
def solve():
    H, W = [int(x) for x in input().split(" ")]
    snake = []
    for _ in range(H):
        snake.append(list(map(str, input().split(" "))))

    for i in range(H):
        for j in range(W):
            if snake[i][j] == "snuke":
                print(i + 1, chr(65 + j))
                print("".join([chr(65 + j), str(i + 1)]))


solve()

Submission status: Wrong Answer

Solution code:
h,w = map(int, raw_input().split())
i = 1
j = 0
while True:
    s = raw_input()
    if len(s) > 6:
        s = s.split(' ')
    try:
        j = s.index("snuke") + 1
        if j > 0:
            break
    except ValueError:
        i += 1
    finally:
        print i, j

print "{0}{1}".format(chr(64+i), j)

Submission status: Wrong Answer

Solution code:
import sys
next(sys.stdin)
r = 1
for line in sys.stdin:
    line = list(line.strip().split())
    try:
        c = line.index('snuke')
        print(str(r) + chr(ord('A') + c))
        break
    except ValueError:
        pass
    r += 1

Submission status: Wrong Answer

Solution code:
h,w=map(int,raw_input().split())
s=[raw_input().split() for _ in xrange(h)]
for i in xrange(h):
    for j in xrange(w):
        if s[i][j]=="snuke":
            print chr(ord("A")+j),i+1
            exit()

Submission status: Accepted

Solution code:
h,w = map(int,input().split())
for i in range(h):
  s = list(map(str,input().split()))
  for j in range(w):
    if s[j] == "snuke":
      print(chr(j+65)+str(i+1))
      exit()

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
y='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(h):
	s=list(input().split())
	if 'snuke' in s:
		print('{}{}'.format(y[s.index('snuke')],i+1))
		break

Submission status: Accepted

Solution code:
H,W = map (int, input ().split ())
x = 1
L = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
for i in range (H):
  A = input ().split ()
  for j in range (W):
    if A[j] == 'snuke':
      print (L[j]+str(i+1))
      x = 0
    if x == 0:
      break
  if x == 0:
    break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
a = [input().split() for i in range(h)]
for i in range(h):
  for j in range(w):
    if a[i][j] == "snuke":
      print(chr(ord("A") + j) + str(i + 1))
      break

Submission status: Accepted

Solution code:
w = []
for i in range(ord("A"), ord("Z") + 1):
  w.append(chr(i))
  
a, b = map(int, input().split())
for i in range(a):
  row = input().split()
  for j in range(b):
    if row[j] == "snuke":
      print(w[j] + str(i + 1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
a = [input().split() for _ in range(h)]

for i in range(h):
    for j in range(w):
        if a[i][j] == 'snuke':
            print(chr(ord('A') + j) + str(i + 1))

Submission status: Accepted

Solution code:
from string import ascii_uppercase


def main(h, w, s):
    h, w = 1, 0  # height, weight

    for row in s:
        for col in row:
            if col == 'snuke':
                print(ascii_uppercase[w] + str(h))
                return
            w += 1

        h += 1
        w = 0


if __name__ == "__main__":
    h, w = map(int, input().split(' '))

    s = [[i for i in input().split(' ')] for _ in range(h)]

    main(h, w, s)

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [input().split() for i in range(h)]
col = [chr(i+65) for i in range(26)]
for i,s_ in enumerate(s):
    if 'snuke' in s_:
        print(f"{col[s_.index('snuke')]}{i+1}")
        break

Submission status: Accepted

Solution code:
def main():
    h,w=map(int,input().split(' '))
    for i in range(h):
        s=input()
        if(s.find('snuke')!=-1):
            print(chr(ord('A')+int(s.find('snuke')/6)),i+1,sep='')
            
main()

Submission status: Accepted

Solution code:
h, w=map(int, input().split())
for i in range(h):
    s=input().split()
    for j, k in enumerate(s):
        
        if k=="snuke":
            a=chr(65+j)
            b=i+1

print("{}{}".format(a, b))

Submission status: Accepted

Solution code:
h,w=map(int, input().split())
s=[list(input().split()) for i in range(h)]
alp="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
  for j in range(w):
    if s[i][j]=="snuke":
      print(alp[j]+str(i+1))
      break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
grid=[]    
for _ in range(h):
    grid.append(list(map(str, input().split())))

for i in range(h):
    for j in range(w):
        if grid[i][j] == "snuke":
            ans = chr(65 + j) + str(i + 1)
            break
            

print(ans)

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
List=[]
alphabet=[chr(i) for i in range(65,65+26)]
for i in range(h):
    line=list(input().split())
    List.append(line)
for i in range(h):
    for j in range(w):
        if List[i][j]=="snuke":
            print(alphabet[j]+str(i+1))

Submission status: Accepted

Solution code:
import sys
T=["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
a,b=map(int,input().split())
for i in range(a):
  L=list(input().split())
  if "snuke" in L:
    p=L.index("snuke")
    i=str(i+1)
    print(T[p]+i)
    sys.exit()

Submission status: Accepted

Solution code:
h, w = map(int,input().split())
s = []
for i in range(h):
	s.append(list(input().split()))
for y in range(h):
	for x in range(w):
		if s[y][x] == "snuke":
			print("{}{}".format(chr(x+65),y+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
ans=''
for i in range(h):
    s=input().split()
    for j in range(w):
        if s[j]=='snuke':
            a=chr(65+j)+str(i+1)
print(a)

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
board=[list(map(str,input().split())) for _ in range(h)]
pos="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
  for j in range(w):
    if board[i][j]=="snuke":
      print(pos[j]+str(i+1))
      exit()

Submission status: Accepted

Solution code:
h, w = map(int, input().split())

l =[list(map(str,input().split())) for i in range(h)]

for i in range(h):
  for j in range(w):
    if l[i][j] == 'snuke':
      print(chr(65+j) + str(i+1))

Submission status: Accepted

Solution code:
_, w, *s = open(0).read().split()
a, b = divmod(s.index("snuke"), int(w))
print(chr(65+b), a+1, sep="")

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
S = [[x for x in input().split()] for _ in range(H)]

num2alpha = lambda c: chr(64+c)

for i in range(H):
    for j in range(W):
        if S[i][j]=='snuke':
            print(num2alpha(j+1) + str(i+1))
            break

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 Final: A – Where's Snuke?
alphabets ='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
h, w = map(int, input().split())
s = [[s for s in input().split()] for _ in range(h)]

for i in range(h):
    if 'snuke' in s[i]:
        print(alphabets[s[i].index('snuke')] + str(i + 1))
        break

Submission status: Accepted

Solution code:
alph = [chr(i) for i in range(65, 65+26)]
H, W = map(int, input().split())
box = [list(input().split()) for _ in range(H)]

for i in range(H):
    for j in range(W):
        if box[i][j] == "snuke":
            print(alph[j] + str(i+1))

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    for  i in range(a[0]):
        s=input()
        list = s.split(" ", )
        if "snuke" in list:
            print(chr(65+list.index("snuke")) + str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
ans=""
for i in range(h):
  s=input().split()
  for j in range(w):
    if s[j]=="snuke":
      ans=chr(ord('A')+j)+str(i+1)
print(ans)

Submission status: Accepted

Solution code:
H, W = map(int,input().split())


a = [input().split() for h in range(H)]

for h in range(H):
  for w in range(W):
    if a[h][w]=="snuke":
      print(str(chr(w+65))+str(h+1))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())

for i in range(H):
  s = input().split()
  if "snuke" in s:
    row = i+1
    col = 65+s.index('snuke')
    break
print("{}{}".format(chr(col), row))

Submission status: Accepted

Solution code:
h, w  = map(int, input().split())
T = [input().split() for i in range(h)]

for i in range(h):
    for j in range(w):
        if T[i][j] == "snuke":
            print(chr(ord("A") + j) + str(i + 1))
            break
    else:
        continue
    break

Submission status: Accepted

Solution code:
al = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
h,w = list(map(int,input().split()))
for i in range(h):
  sn = input().split()
  if "snuke" in sn:
    print("{}{}".format(al[sn.index("snuke")],i+1))
    break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
for i in range(h):
    lst = input().split()
    for j in range(w):
        if lst[j] == 'snuke':
            print(chr(ord('A')+j)+str(i+1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]

for i, row in enumerate(s, 1):
    for j, e in enumerate(row, ord("A")):
        if e == "snuke":
            print(chr(j) + str(i))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
graph = [input().split() for _ in range(H)]
alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(H):
    for j in range(W):
        if graph[i][j] == "snuke":
            print(alpha[j]+str(i+1))
            exit()

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
ans_x=0
ans_y=0
for i in range(h):
    s=list(input().split())
    for j in range(w):
        if s[j]=="snuke":
            ans_x=j+1
            ans_y=i+1
print(chr(96+ans_x).upper()+str(ans_y))

Submission status: Accepted

Solution code:
import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint
N, K = map(int, input().split())

1行のstring
S, T = input().split()

1行の整数配列
P = list(map(int,input().split()))

改行あり整数
x = []
y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)

N行M列の初期化
dp = [[INF] * M for i in range(N)]

'''

H, W  = map(int, input().split())

S = []
for i in range(H):
    s = list(map(str,input().split()))
    S.append(s)


for w in range(W):
    for h in range(H):
        if S[h][w] == "snuke":
            print("{}{}".format(chr(ord("A")+w), h+1))
            sys.exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

h, w = [int(x) for x in input().split()]
for i in range(h):
    e = input().split()
    if "snuke" in e:
        print(chr(ord('A') + e.index("snuke")), end='')
        print(i + 1)
print('')

Submission status: Accepted

Solution code:
H, W =map(int, input().split())
string_list = [input().split() for i in range(H)]

for i in range(H):
    for j in range(W) :
        if string_list[i][j] == "snuke":
            print(chr(65 + j) + str(i + 1))
            break

Submission status: Accepted

Solution code:
h,w = map(int , input().split())
alf = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(h):
  for j,s in enumerate(input().split()):
    if s == 'snuke':
      print(alf[j] + str(i+1))

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,W = MI()
    G = [list(ST().split()) for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if G[i][j] == "snuke":
                print(chr(ord("A")+j) + str(i+1) ) 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
h,w = map(int,input().split())
sl = []

for i in range(h):
    s = list(map(str,input().split()))
    sl.append(s)

for i in range(h):
    for j in range(w):
        if sl[i][j] == "snuke":
            ans = (i, j)

ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

print(ascii_uppercase[ans[1]] +  str(ans[0]+1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
H, W = map(int, input().split())

for i in range(1, H+1) :
  L = list(map(str, input().split()))
  for j in range(W) :
    if L[j] == "snuke" :
      s = chr(j+ord("A")) + str(i)
      print (s)
      exit()

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 Final - A
# -*- encoding: UTF-8 -*-
h, w = map(int, input().split())

hx = 0
wx = 0

tTable = []
for i in range(h):
  tList = input().split()
  if "snuke" in tList:
    hx = i
    wx = tList.index("snuke")

print(chr(ord("A")+wx) + str(hx+1))

Submission status: Accepted

Solution code:
h,w =map(int,input().split())
d={}
for i in range(h):
  s=list(input().split())
  for j in range(len(s)):
    d[s[j]]=[i,j]
    
a=d["snuke"]
print("{}{}".format(chr(a[1]+65),a[0]+1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [input().split() for _ in range(h)]

for i in range(h):
	for j in range(w):
		if s[i][j] == "snuke":
			print(chr(ord('A')+j),i+1,sep='')

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    h,w = map(int,input().split())
    s = []
    for i in range(h):
        x = [y for y in input().split()]
        s.append(x)
    for i in range(h):
        for j in range(w):
            if s[i][j] == 'snuke':
                ans = [chr(j + 65),str(i + 1)]
                print(''.join(ans))
                return
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
from string import *
h,w=map(int,input().split())

s = [input().split() for _ in range(h)]

for i in range(h):
    for j in range(w):
        if(s[i][j]=='snuke'):
            idx1=ascii_lowercase[j].swapcase()
            idx2=str(i+1)
            print(idx1+idx2)
            exit()

Submission status: Accepted

Solution code:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Submission status: Accepted

Solution code:
h, w = map(int,input().split())
s = [input().split() for _ in range(h)]
for i in range(h):
  for j in range(w):
    if s[i][j] == 'snuke':
      print(chr(ord('A')+j)+str(i+1))
      exit(0)

Submission status: Accepted

Solution code:
import sys
if sys.platform == 'ios':
	sys.stdin = open('input.txt')

h,w = map(int,input().split())

s = [list(map(str,input().split())) for i in range(h)]

a = 0
b = 0

for i in range(h):
	for j in range(w):
		if s[i][j]=='snuke':
			a = i + 1
			b = chr(j+97).upper()
			
print(str(b)+str(a))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
s=[[i for i in input().split()] for i in range(h)]

for i in range(h):
    for j in range(w):
        if s[i][j]=='snuke':
            r=i+1
            s=chr(j+97).upper()
            print(s+str(r))
            exit()

Submission status: Accepted

Solution code:
import string
H, W = map(int, input().split())
ABC = string.ascii_uppercase

for i in range(H):
    LIST = list(map(str,input().split()))
    for l in range(W):
        if LIST[l] == "snuke":
            print(ABC[l]+str(i+1))

Submission status: Accepted

Solution code:
h,w = map(int, input().split())
s = [list(input().split()) for i in range(h)]
for key_i,i in enumerate(s):
  key_i += 1
  for key_j,j in enumerate(i):
    if j == "snuke":
      print(chr(ord("A")+key_j)+str(key_i))
      exit()

Submission status: Accepted

Solution code:
alfa = [chr(i) for i in range(65, 65+26)]
H,W = (int(i) for i in input().split())
X = []
for i in range(H):
    tmp = [str(i) for i in input().split()]
    X.append(tmp)
check = 0
h = 0
w = 0
for i in range(H):
    for j in range(W):
        if X[i][j] == 'snuke':
            check = 1
            h = i + 1
            w = alfa[j]
print(w + str(h))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
a='abcdefghijklmnopqrstuvwxyz'
s=[input().split() for i in range(h)]
for i in range(h):
    ss=s[i]
    for j in range(len(ss)):
        if ss[j]=='snuke':
            print(a[j].upper()+str(i+1))
            exit()

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
for i in range(1, H+1):
    S = input().split()
    for j, s in enumerate(S):
        if s == "snuke":
            print(chr(j+65)+str(i))

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 Final: A – Where's Snuke?
h, w = [int(s) for s in input().split()]
s = [[s for s in input().split()] for _ in range(h)]
characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

for i in range(h + 1):
    if 'snuke' in s[i]:
        print(characters[s[i].index('snuke')] + str(i + 1))
        break

Submission status: Accepted

Solution code:
#Where's Snuke?
H, W = map(int, input().split())
ab = [chr(ord('A') + i) for i in range(26)]
for i in range(H):
    S = input().split()
    for j in range(W):
        if S[j] == "snuke":
            print(ab[j]+str(i+1)) 
            break

Submission status: Accepted

Solution code:
import string as st
h,w = map(int,input().split())
l = [[str(i) for i in input().split()] for i in range(h)]
a = list(st.ascii_uppercase)
num = list(str(i) for i in range(1,27))
for i,j in zip(l,num):
    for x,y in zip(i,a):
        if x == 'snuke':
            print(y + j)

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [input().split() for _ in range(h)]
alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            print(alpha[j]+str(i+1))

Submission status: Accepted

Solution code:
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    H,W = [int(x) for x in stdin.readline().rstrip().split()]

    table = [stdin.readline().rstrip().split() for _ in range(H)]

    l = [chr(i) for i in range(65, 65+26)]
    for h in range(0,H) :
        for w in range(0,W) :
            if(table[h][w] == "snuke"):
                print(l[w] + "" + str(h + 1))
solve();

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque




def main():
    high, width = map(int, input().split())
    data = [input().split() for i in range(high)]

    for i in range(high):
        for j in range(width):
            if data[i][j] == 'snuke':
                print('{}{}'.format(chr(j + 65), i + 1))






if __name__ == '__main__':
    main()