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:
h,w=map(int,input().split())
s=[input().split() for _ in range(h)]

a="ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(h):
  for j in range(w):
    if s[i][j]=="snuke":
      print(a[j]+str(i+1))
      exit()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    h, w = list(map(int, input().rstrip('\n').split()))
    s = [list(map(str, str(input().rstrip('\n')).split())) for _ in range(h)]
    for i in range(h):
        for j in range(w):
            if s[i][j] == "snuke":
                print(chr(97 + j).upper() + str(i + 1))
                exit()


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
num2alpha = lambda c: chr(c+64)
h,w = map(int,input().split())
a=0
b=0
for i in range(h):
    s = input().split()
    for j in range(w):
        if(s[j]=="snuke"):
            a=i+1
            b=j+1
            break
a=str(a)
b=num2alpha(b)
b=str(b)
s=[b,a]

print(''.join(s))

Submission status: Accepted

Solution code:
h,w = map(int,input().split())
i = 0
j = 0
ans = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(h):
  a = input().split()
  for j in range(w):
    if a[j] == "snuke":
      print(ans[j]+str(i+1))

Submission status: Accepted

Solution code:

h,w = map(int,input().split())
a = []
for i in range(0, h):
    a.append(list(input().split()))
    
for i in range(0,h):
    for j in range(0,w):
        if a[i][j] == 'snuke':
            print(chr(ord('A')+j),i+1,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
l=[list(input().split()) for _ in range(h)]
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: Accepted

Solution code:
import string
H, W = map(int, input().split())
flag = False
for i in range(H):
    for j, s in enumerate(input().split()):
        if s == "snuke":
            print("%s%d" % (string.ascii_uppercase[j], i+1))
            flag = True
            break
    if flag:
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(H)
# print(W)

ah = 0
aw = 0

alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

for i in range(H):
    # print(0)
    
    s = list(input().split(" "))
    for j in range(W):
        # print(s[j])
        
        if s[j] == 'snuke':
            # print('〇')
            ah = i
            aw = j

# print(alp[aw])
# print(ah + 1)


print(str(alp[aw]) + str(ah + 1))

Submission status: Accepted

Solution code:
H, W = map(int,input().split())
s = [list(input().split()) for i in range(H)]
al = [chr(i) for i in range(65,65+26)]
for i in range(H):
    for j in range(W):
        if s[i][j] == 'snuke':
            print(al[j] ,end = '')
            print(i+1)
            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':
            row=i
            col=j
            break

def num2alpha(c):
    return chr(c+64+1)

print(num2alpha(col)+str(row+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[(print(chr(ord('A')+i)+str(h+1)),quit())for H,W in [map(int,input().split())]for h in range(H)for i,v in enumerate(input().split())if v=="snuke"]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Lower = [chr(i) for i in range(65, 65 + 26)]

h, w = map(int, input().split())
ans = "A1"
for i in range(h):
    s = list(map(str, input().split()))
    for j in range(w):
        if s[j] == "snuke":
            ans = Lower[j] + str(i + 1)
print(ans)

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

Submission status: Accepted

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

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

for i in range(h):
    for j in range(w):
        if li[i][j] == "snuke":
            s = i + 1
            t = j
            
tmp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
tmp = list(tmp)

print(tmp[t] + str(s))

Submission status: Accepted

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

table = []
for _ in range(H):
    table.append(input().split())

for i in range(H):
    for j in range(W):
        if table[i][j] == "snuke":
            print(chr(ord("A")+j) + str(i+1))
            exit()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
H,W= map(int,input().split())
alpha=["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(str(_) for _ in input().split())
	for j in range(W):
		if A[j] == "snuke" :
			al = alpha[j]
			high = str(i+1)
			print(al+high)
			break

Submission status: Accepted

Solution code:
import string
H, W = map(int, input().split())
for i in range(1, H+1):
    S = list(input().split())
    for index, s in enumerate(S):
        if s == 'snuke':
            print(string.ascii_uppercase[index]+str(i))
            exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

from sys import exit

h, w = getList()
for i in range(h):
    strs = input().split()

    for j, s in enumerate(strs):
        if s == "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=[i for i in input().split()]
    if 'snuke' in l:
        print(chr(ord('A')+l.index('snuke'))+str(i+1))
        exit()

Submission status: Accepted

Solution code:
import sys
h,w=map(int,input().split())
A=[chr(i) for i in range(ord('A'), ord('Z')+1)]
s=[]
for i in range(h):
    s.append(list(map(str,input().split())))
for i in range(h):
    for j in range(w):
        if s[i][j]=='snuke':
            a=A[j]
            b=str(i+1)
            print(a+b)
            sys.exit()

Submission status: Accepted

Solution code:
from itertools import product

H, W = map(int, input().split())
table = [input().split() for _ in range(H)]
for i, j in product(range(H), range(W)):
    if table[i][j] == 'snuke': print('ABCDEFGHIJKLMNOPQRSTUVWXYZ'[j] + str(i+1)); break

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:
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:
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+1)

print(answer)

Submission status: Accepted

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

l = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

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('{}{}'.format(chr(j + ord('a')).upper(), i + 1))
            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":
			print(chr(97 + j).upper() + str(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(64+(j+1))+str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
l=[]
for i in range(h):l.extend(list(input().split()))
x=l.index("snuke")
y=x%w
x=x//w+1
print(chr(65+y)+str(x))

Submission status: Accepted

Solution code:
import string

def solve():
	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(string.ascii_uppercase[j:j+1] + str(i+1))
				return

solve()

Submission status: Accepted

Solution code:
H,W= map(int,input().split())
alfa = ["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 h in range(H):
    Ss = list(input().split())
    if "snuke" in Ss:
        print(alfa[Ss.index("snuke")]+str(h+1))

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":
            ans = [ord("A")+j,i+1]
            print("{}{}".format(chr(ans[0]),ans[1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
col = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
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: 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("ABCDEFGHIJKLMNOPQRSTUVWXYZ"[j]+str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
l=[]
import string
abc=string.ascii_uppercase
for i in range(h):
    li=list(map(str,input().split()))
    l.append(li)
for x in range(h):
    for y in range(w):
        if l[x][y] == 'snuke':
            print(abc[y]+str(x+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) + str(1 + 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(1 + i))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
    for j in range(w):
        if s[i][j] == "snuke":
            print(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 in range(H):
    for j in range(W):
        if S[i][j] == 'snuke':
            print(chr(ord('A') + j) + str(1 + i))
            break

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
alpha='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(1,H+1):
  S=input().split()
  if 'snuke' in S:
    print(alpha[S.index('snuke')]+str(i))
    break

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
S = [list(input().split()) for i in range(H)]
flag = True
for h in range(H):
    for w in range(W):
        if S[h][w] == 'snuke':
            id = [h,w]
            flag = False
            break
    if not flag:
        break
print(str(chr(w+65))+str(h+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
alphabets=["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(alphabets[j]+str(i+1))
      break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
snuke = []
for i in range(H):
  snuke.append(list(input().split()))
for i in range(H):
  for j in range(W):
    if snuke[i][j] == "snuke":
      ans = [i, j]
      break

print(chr(65+ans[1])+str(ans[0]+1))

Submission status: Accepted

Solution code:
h,w=map(int, input().split())
for i in range(h):
  l = input().split()
  if 'snuke' in l:
    t=l.index('snuke')
    print('%s%d' % (chr(t+ord('A')), i+1))
    quit(0)

Submission status: Accepted

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//6)+str(i+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(64+(j+1))+str(i+1))

Submission status: Accepted

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[j] + str(i+1)
print(res)

Submission status: Accepted

Solution code:
h, w = map(int,input().split())
alphabet_large = [chr(i) for i in range(65, 65+26)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,W=map(int,input().split(' '))
S=[input().split(' ') for i in range(H)]
row = -1
for i in range(H):
    if 'snuke' in S[i]: row=i+1
col='ABCDEFGHIJKLMNOPQRSTUVWXYZ'[S[row-1].index('snuke')]
print(str(col)+str(row))

Submission status: Accepted

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

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

Submission status: Accepted

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

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(64+(j+1))+str(i+1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [input().split() for _ in range(h)]
al = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
  for j in range(w):
    if s[i][j] == "snuke":
      print("{}{}".format(al[j], i+1))
      exit()
    else:
      pass

Submission status: Accepted

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

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

print(ans)
print()

Submission status: Accepted

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

idx = s.index("snuke")
if w != 1:
    col = (idx+1)%w
    alpha = chr(col+64)
else:
    alpha = "A"

row = idx//w+1
ans = alpha + str(row)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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]+1))

Submission status: Accepted

Solution code:
h,w,*a=open(0).read().split();b=a.index("snuke");w=int(w);print(chr(b%w+65)+str(b//w+1))

Submission status: Accepted

Solution code:
h,w,*a=open(0).read().split();b=a.index("snuke");print(chr(b%int(w)+65)+str(b//int(w)+1))

Submission status: Accepted

Solution code:
_,w,*a=open(0).read().split();w=int(w);i=a.index('snuke');print(chr(i%w+65)+str(i//w+1))

Submission status: Accepted

Solution code:
#(ﾉ･_･)‥‥…━━━━━☆ﾋﾟｰｰｰ!
_,w,*a=open(0).read().split();w=int(w);i=a.index('snuke');print(chr(i%w+65)+str(i//w+1))

Submission status: Accepted

Solution code:
h,w,*a=open(0).read().split();b=a.index("snuke");print([chr(i)for i in range(65,91)][b%int(w)]+str(b//int(w)+1))

Submission status: Accepted

Solution code:
h,w,*a=open(0).read().split();b=a.index("snuke")
print([chr(i)for i in range(65,91)][b%int(w)]+str(b//int(w)+1))

Submission status: Accepted

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

for i in range(H):
  cols = input().split()
  
  if 'snuke' in cols:
    print(chr(ord('A') + cols.index('snuke')) + str(i + 1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
c = []
for i in range(h):#h:高さ
    c.append([str(m) for m in input().split()])
ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
    for j in range(w):
        if c[i][j] == "snuke":
            print(ALPHA[j],i + 1,sep="")

Submission status: Accepted

Solution code:
import string
h,w = (int(i) for i in input().split())
a = []
for i in range(h):
 a.append(list(input().split()))
query = string.ascii_uppercase
for j in range(h):
  for k in range(w):
    if a[j][k] == 'snuke':
      print(query[k]+str(j+1))

Submission status: Accepted

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

Submission status: Accepted

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[j]+str(i+1))

Submission status: Accepted

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

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:
H,W=map(int,input().split())

A=["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(1,H+1):
    a=list(map(str,input().split()))
    for j in range(W):
        if a[j]=="snuke":
            print(A[j]+str(i))
            exit()

Submission status: Accepted

Solution code:
import string

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 = string.ascii_uppercase[j] + str(i + 1)
            break


print(ans)

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(65+j)+str(i+1))

Submission status: Accepted

Solution code:
import itertools
H, W = [int(_) for _ in input().split()]
S = [input().split() for _ in range(H)]
for i, j in itertools.product(range(H), range(W)):
    if S[i][j] == 'snuke':
        print('ABCDEFGHIJKLMNOPQRSTUVWXYZ'[j]+str(i+1))
        exit()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

car = ['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 H in range(a):
	tmp = list(map(str, input().split()))
	for j in range(b):
		if tmp[j]=='snuke':
			ans = [car[j], str(H+1)]

print(''.join(ans))

Submission status: Accepted

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

for i in range(H):
  for j in range(W):
    if S[i][j] == "snuke":
      print(strl[j] + str(i+1))
      exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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 in range(h):
        for j in 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: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_uppercase
H, W = map(int, input().split())
for i in range(H):
    for c, s in zip(ascii_uppercase, input().split()):
        if s == 'snuke':
            print('{}{}'.format(c, i + 1))
            exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    h, w = map(int, input().split())
    s = [list(map(str, input().split())) for _ in range(h)]
    alpha = [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(alpha[j] + str(i + 1))
                exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import string
alph = string.ascii_uppercase

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(alph[j], str(i + 1), sep="")

Submission status: Accepted

Solution code:
def a_where_is_snuke(H, W, S):
    for r, row in enumerate(S):
        for c, col in enumerate(row):
            if col == 'snuke':
                ans = str(chr(ord('A') + c)) + str(r + 1)
                break
        else:
            continue
        break
    return ans

H, W = [int(i) for i in input().split()]
S = [input().strip().split() for _ in range(H)]
print(a_where_is_snuke(H, W, S))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

H,W = inpl()
ss = [inpls() for i in range(H)]

for y in range(H):
	for x in range(W):
		if ss[y][x] == 'snuke':
			ans = chr(65+x) + str(y+1)
			print(ans)
			sys.exit()

Submission status: Accepted

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