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: Accepted

Solution code:
# A - Where's Snuke?
h, w = map(int, input().split())
alphabets = [chr(i) for i in range(65, 65+26)]

for i in range(h):
	s = list(input().split())
	
	for j in range(w):
		if s[j] == 'snuke':
			print(alphabets[j] + str(i+1))
			exit()

Submission status: Accepted

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

Submission status: Accepted

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

i=1
while i<=H:
    L=input().split()
    if 'snuke'in L:
        print(A[L.index('snuke')]+str(i))
        break
    i+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
hans=0
wans=0
yn=0
wlist=[]
for i in range(26):
    a=65+i
    wlist.append(chr(a))
for i in range(h):
    s=list(input().split())
    for j in range(w):
        if s[j]=="snuke":
            hans=i+1
            wans=j
            yn=1
            break
    if yn==1:
        break
print(wlist[wans]+str(hans))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
alp=['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']
l=[]
for i in range(h):
    a=list(map(str,input().split()))
    l.append(a)
for j in range(h):
    for k in range(w):
        if l[j][k]=='snuke':
            print(alp[k]+str(j+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
b=["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=list(input().split())
  for j in range(w):
    if a[j]=="snuke":
      print(b[j],end="")
      print(i+1)

Submission status: Accepted

Solution code:
al=[chr(ord('A') + i) for i in range(26)]

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":
      ans=al[j]+str(i+1)
      print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# 数値(1~26)→(A~Z)
num2alpha = lambda c: chr(c+64)

h,w = map(int,input().split())
A = list(input().split() for i in range(h))

for i in range(w):
    for j in range(h):
        if A[j][i] == 'snuke':
          print(num2alpha(i+1)+str(j+1))
          sys.exit()

Submission status: Accepted

Solution code:
import string
h,w=map(int,input().split())
s=[]
for _ in range(h):
    s.append(list(input().split()))
for y in range(h):
    if 'snuke' in s[y]:
        I1=y
        I2=s[y].index('snuke')
        break
a=list(string.ascii_uppercase)
print(a[I2]+str(I1+1))

Submission status: Accepted

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

h = w = 0
for i in range(H):
    if 'snuke' in S[i]:
        h = i
        w = S[i].index('snuke')
        break
print(chr(ord('A') + w) + str(h + 1))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    al=list(chr(ord('A')+i) for i in range(26))
    h,w=map(int, input().split())
    l=[list(input().split()) for i in range(h)]
    for hh in range(h):
        for ww in range(w):
            if l[hh][ww]=='snuke':
                print(al[ww]+str(hh+1))
resolve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    al=['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']
    h,w=map(int, input().split())
    l=[list(input().split()) for i in range(h)]
    for j in range(h):
        for k in range(w):
            if l[j][k]=='snuke':
                print(al[k]+str(j+1))
resolve()

Submission status: Accepted

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

Submission status: Accepted

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':
            print(chr(ord('A') + j)+str(i+1))
            exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
S=([chr(ord('a') + i) for i in range(26)])
L=[]
for i in range(H):
	L.append(input().split())
for i in range(H):
	for j in range(W):
		if L[i][j]=="snuke":
			print(str.upper(S[j]),end="")
			print(i+1)

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
r = ["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):
    s_in = list(input().split())
    judge = "snuke" in s_in
    if judge:
        line = i + 1
        row = r[s_in.index("snuke")]

print("{}{}".format(row, line))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

h,w = na()
co = ['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):
    s = nn()
    if 'snuke' in s:
        j = s.index('snuke')
        print(co[j]+str(i+1))
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

h, w = map(int, readline().split())
s = [readline().rstrip().decode().split() for _ in range(h)]
al = [chr(ord('A') + i) for i in range(26)]
for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            print(al[j] + str(i + 1))

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    h,w = map(int, input().split())
    alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #26
    l = [list(input().rstrip().split()) for _ in range(h)]
    for i in range(h):
        for j in range(w):
            if l[i][j] == 'snuke':
                print('{}{}'.format(alphabet[j], i+1))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alp=[s.upper() for s in list('aqwsedrftgyhujikolpmnbvcxz')]
alp.sort()
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(str(alp[j])+str(i+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_uppercase

h, w = map(int, input().split())
columns = ascii_uppercase
for i in range(h):
    cells = input().split()
    for j in range(w):
        if cells[j] == 'snuke':
            print(ascii_uppercase[j] + str(i + 1))
            exit()

Submission status: Accepted

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

l = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')

a = 0
for i in range(H):
    s = input()
    s = s.split(' ')
    a += 1
    if 'snuke' in s:
        w = s.index('snuke')
        h = a

print(l[w]+str(h))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    h,w=map(int,input().split())
    for i in range(h):
        s=[_ for _ in input().split()]
        for j in range(w):
            if s[j]=="snuke":
                print(chr(ord('A')+j)+str(i+1))
                sys.exit()

if __name__=='__main__':
    main()

Submission status: Accepted

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

for i in range(1, H + 1):
    si = input().split()
    for j in range(W):
        if si[j] == 'snuke':
            print("{}{}".format(chr(65 + j), i))

Submission status: Accepted

Solution code:
H, W = 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':
            print(chr(j+65)+str(i+1))
            exit()

Submission status: Accepted

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

Submission status: Accepted

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':
            i += 1
            j += 65
            print(chr(j), i, sep='')
            break

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
P = [list(input().split()) for i in range(H)]
list_ALPHABET = [chr(i) for i in range(65,91)]

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""
for i in range(h):
    for j in range(w):
        if l[i][j] == "snuke":
            ans = "{}{}".format(chr(ord('A')+j), i+1)


print(ans)

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
A=[input().split() for _ in range(h)]
for a in range(h):
  for b in range(w):
    if A[a][b]=="snuke":
      print("{1}{0}".format(a+1,chr(ord("A")+b)))
      break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
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(st[j],i+1,sep='')
            exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10

#solve
def solve():
    h, w = LI()
    s = LSR(h)
    for i in range(h):
        for j in range(w):
            if s[i][j] == "snuke":
                print(chr(ord("A") + j) + str(i + 1))
                return
        
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
h,w = map(int, input().split())
l = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(h):
  tmp = list(map(str, input().split()))
  if tmp.count('snuke') == 1:
    a = l[tmp.index('snuke')]
    b = str(i + 1)
print(a + b)

Submission status: Accepted

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

A = []
t = 0
u = 0
for i in range(h):
    s = list(input().split())
    # t  = s.index("snuke")
    if s.count("snuke") >= 1:
        t = s.index("snuke")
        u = i
        break

print(chr(ord('A') + t) + str(u+1))

Submission status: Accepted

Solution code:
al=[chr(ord('A') + i) for i in range(26)]

H, W = map(int, input().split())
S = [list(map(str, input().split())) for _ in range(H)]
h = 0
w = 0
for i in range(H):
    for j in range(W):
        if S[i][j] == "snuke":
            h = i
            w = j

ans = al[w] + str(h+1)
print(ans)

Submission status: Accepted

Solution code:
def main():
    height, width = map(int, input().split())
    grid = [input().split() for _ in range(height)]
    answer = ""
    for i in range(height):
        if answer != "":
            break
        for j in range(width):
            if grid[i][j] == "snuke":
                answer = str(chr(ord("a") + j)).upper() + str(i + 1)
                break
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [[i for i in input().split()] for _ in range(h)]
for i, s_row in enumerate(s):
    for j in range(w):
        if s_row[j] == "snuke":
            print(chr(65 + j) + "{}".format(i+1))
            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(65+j) + str(i+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
Alf = 'ABCDEFGHIJKLNMOPQRSTUVWXYZ'
for i in range(h):
    S = input().split()
    if 'snuke' in S:
        print(Alf[S.index('snuke')]+str(i+1))
        break

Submission status: Accepted

Solution code:
H,W = [int(i) for i in input().split()]
li = ['0']*H
al = [chr(ord('A') + i) for i in range(26)]
for i in range(H):
    li[i] = input().split()
for i in range(H):
    for j in range(W):
        if li[i][j] == 'snuke':
            k = str(i+1)
            r = al[j]
            print(r+k)
            exit()

Submission status: Accepted

Solution code:
x,y=list(map(int, input().split()))
s=[list(map(str,list(input().split()))) for i in range(x)]

for i in range(x):
	for j in range(y):
		if s[i][j]=='snuke':
			print(str(chr(65+j))+str((i+1)))

Submission status: Accepted

Solution code:
H, W = list(map(int, input().split()))
M = []

A = [chr(i) for i in range(ord('A'), ord('Z')+1)]

for i in range(H):
    r = input().split()
    M.append(r)


# for i in range(H):
#     print(M[i])

for i in range(H):
    for j in range(W):
        if M[i][j] == 'snuke':
            output = A[j] + str(i+1) 
            print(output)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
ss = 'snuke'
for i in range(H):
  s=input().split()
  if ss in s:
    print(chr(ord('A')+s.index(ss)) + str(i+1))
    break

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    h, w = list(map(int,ipti().split()))

    s = [0]*h

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

    for row in range(h):
        for col in range(w):
            if s[row][col] == "snuke":
                print(chr(col+65)+str(row+1))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alf = list("abcdefghijklmnopqrstuvwxyz")

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

for i in range(h):
    line = list(input().split())
    if "snuke" in line:
        x = line.index("snuke")
        y = i

print(alf[x].upper(),y+1, sep='')

Submission status: Accepted

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

Submission status: Accepted

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(ord('A')+j)+str(i+1))
      break

Submission status: Accepted

Solution code:
A = [chr(i) for i in range(65,91)]
k = []
H,W = map(int,input().split())
for i in range(H):
    S = input().split()
    k.append(S)
for i in range(H):
    for j in range(W):
        if k[i][j] == "snuke":
            print(A[j]+str(i+1))

Submission status: Accepted

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

for i in range(h):
    for j in range(w):
        if a[i][j]=='snuke':
            print(chr(65+j)+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()
    if 'snuke' in s:
        print(chr(65+s.index('snuke'))+str(i))

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))

Submission status: Accepted

Solution code:
def main():
	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(ord('A')+j)+str(i+1))
				return

main()

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
y, x = -1, -1
for i in range(h):
    d = input().split()
    for j in range(w):
        if d[j] == "snuke":
            y, x = i, j
a = chr(ord("A") + x )
print("{0}{1}".format(a, y+1))

Submission status: Accepted

Solution code:
import string
from sys import stdin
H, W = [int(_) for _ in stdin.readline().rstrip().split()]
S = [stdin.readline().rstrip().split(' ') for _ in range(H)]
for i in range(H):
    for j in range(W):
        if S[i][j] == 'snuke': 
            print(string.ascii_uppercase[j]+str(i+1))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
h,w = map(int,input().split())
for i in range(h):
    s = list(map(str,input().split()))
    if "snuke" in s:
        idx = s.index("snuke")
        out = chr(65+idx)+str(i+1)
        print(out)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    H, W = (int(i) for i in input().split())
    c = [[i for i in input().split()] for j in range(H)]
    al = {i: chr(ord('A') + i) for i in range(26)}
    for h in range(H):
        for w in range(W):
            if c[h][w] == "snuke":
                return print(al[w]+str(h+1))


if __name__ == '__main__':
    main()

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())
M = [input().split() for _ in range(H)]
for i, r in enumerate(M):
  for j, c in enumerate(r):
    if c == 'snuke':
      print("%s%d" %(chr(ord('A')+j), i+1))

Submission status: Accepted

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

S = 'snuke'

for i in range(H):
    for j, s in enumerate(input().split()):
        if s == S:
            print(chr(ord('A') + j) + str(i + 1))

Submission status: Accepted

Solution code:
h, w = map(int,input().split())
C = [list(input().split()) for i in range(h)]
import string
A = [chr(i) for i in range(ord("A"), ord("Z")+1)]
a = -1
b = -1
for i in range(h):
    for j in range(w):
        if C[i][j] == "snuke":
            a = i
            b = j
print("{}{}".format(A[b], a+1))

Submission status: Accepted

Solution code:
from collections import defaultdict
def main():
    H,W = map(int,input().split())
    ls = [[str(x) for x in input().split()] for _ in range(H)]
    dic = defaultdict(str)
    for i,now in enumerate([chr(i) for i in range(65, 65+26)]):
        dic[i] = now

    for i in range(H):
        for j in range(W):
            if ls[i][j]=="snuke":
                ans = dic[j]+str(i+1)
                print(ans)
                exit()
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
S = [input().split() for _ in range(H)]
x = ""
for i in range(H):
    for j in range(W):
        if S[i][j]=="snuke":
            x = (i,j)
            break
    if x!="":break
a = str(i+1)
b = chr(65+j)
print(b+a)

Submission status: Accepted

Solution code:
from sys import stdin
import string

h,w = [int(x) for x in stdin.readline().rstrip().split()]

li = [list(stdin.readline().rstrip().split()) for _ in range(h)]

for i in range(h):
    for j in range(w):
        if li[i][j] == "snuke":
            print(string.ascii_uppercase[j]+str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
alphabet = ["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):
  s=list(map(str,input().split()))
  for j in range(w):
    if s[j]=="snuke":
      print(alphabet[j]+str(i+1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

H, W = map(int, input().split())
S = list(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':
            print(chr(65 + j) + str(i + 1))
            break

Submission status: Accepted

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

for i in range(h):
	t = list(map(str,input().split()))
	for j in range(w):
		if t[j] == "snuke":
			hh = str(i+1)
			ww = chr(65+j)
			break

print("".join([ww,hh]))

Submission status: Accepted

Solution code:
import string
H, W = map(int, input().split())
hw = [list(input().split()) for _ in range(H)]
ans = []
sans = ''
for i in range(H):
    for j in range(W):
        if hw[i][j] == 'snuke':
            ans.append(i)
            ans.append(j)
            break

sans = string.ascii_uppercase[ans[1]] + str(ans[0] + 1)

print(sans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ls = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
x = [list(input().split()) for i in range(a)]
for i in range(a):
  for j in range(b):
    if x[i][j] == "snuke":
      print(ls[j]+str(i+1))
      break

Submission status: Accepted

Solution code:
import sys
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(65+j)+str(i+1))
      sys.exit()

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
S = [list(input().split()) for _ in range(H)]
#print(S)
al=[chr(ord('A') + i) for i in range(26)]
for h in range(H):
  for w in range(W):
    if S[h][w] == "snuke":
      print(al[w],h+1,sep="")