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

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

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

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

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

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

Solution (Python):
def main():
    h, w = map(int, input().split())
    s_list = [list(input().split()) for _ in range(h)]

    for r in range(h):
        for c in range(w):
            if s_list[r][c] == "snuke":
                print(chr(ord("A") + c) + str(r + 1))
                break


if __name__ == "__main__":
    main()

Solution (Python):
h,w = map(int,input().split())
l = [list(input().split()) for i in range(h)]
for i in range(h):
    for j in range(w):
        if l[i][j] == "snuke":
            x = chr(ord("A")+j)
            print("{}{}".format(x,i+1))

Solution (Python):

h, w = map(int,input().split())
alp=[chr(i) for i in range(65, 65+26)]
for i in range(h):
    l=list(map(str,input().split()))
    if "snuke" in l:
        print(alp[l.index("snuke")]+str(i+1))
        break

Solution (Python):
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(j+65),i+1,sep="")

Solution (Python):
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(ord("A")+j)+str(i+1))
            exit()

Solution (Python):
H,W=map(int,input().split())
for i in range(H):
  try:
    print(f"{chr(ord('A')+input().split().index('snuke'))}{i+1}")
    exit()
  except:
    pass

Solution (Python):
H, W = map(int, input().split())
flag = False
for i in range(H):
    S = list(input().split())
    for j, s in enumerate(S):
        if s == "snuke":
            print(chr(ord('A')+j)+str(i+1))
            flag = True
            break

    if flag:
        break

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

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

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

Solution (Python):
h, w = map(int, input().split())
s = []

for i in range(h):
    S = list(input().split())
    s.append(S)

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

Solution (Python):
h, w = map(int, input().split())
s = []

for i in range(h):
    S = list(input().split())
    s.append(S)

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

Solution (Python):
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))

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

Solution (Python):
a,b=map(int,input().split())
c = ["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"]
x = ""
for i in range(a):
    x = input().split()
    if x.count("snuke") == True:
        for j in range(b):
            if x[j] == "snuke":
                print(c[j] + str(i+1))

Solution (Python):
import sys, math
from functools import lru_cache
from collections import deque

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    H, W = mi()
    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))
                return


        

if __name__ == '__main__':
    main()

Solution (Python):
h,w = map(int,input().split())
s = [list(input().split()) for _ in range(h)]
ch = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
word = "snuke"
for i in range(h):
    for j in range(w):
        if s[i][j] == word:
            print(ch[j],i+1,sep = "")
            break

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

h,w = rm()
for i in range(h):
    a = list(rs())
    for idx, j in enumerate(a):
        if j == 'snuke':
            print(f'{chr(65+idx)}{i+1}')
            exit()

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  H,W=map(int,pin().split())
  ans=""
  for i in range(H):
    S=list(pin().split())
    for j in range(W):
      if S[j]=="snuke":
        ans=f"{chr(65+j)}{i+1}"
  print(ans)
  return 

main()

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

Solution (Python):
import collections


def main():
    aList = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    text = ""
    H, W = map(int, input().split())
    for h in range(H):
        wList = list(map(str, input().split()))
        if wList.count("snuke") == 1:
            text = aList[wList.index("snuke")] + str(h + 1)
    print(text)


if __name__ == '__main__':
    main()

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

Solution (Python):
H,W = map(int, input().split())
alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(H):
  for j,x in enumerate(input().split()):
    if x == 'snuke':
      ret = alpha[j] + str(i+1)
      print(ret)

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

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

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

Solution (Python):
num2alpha = lambda c: chr(c+64)

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

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

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

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

Solution (Python):
h,w = map(int,input().split())
for i in range(h):
    tmp = list(input().split())
    for j in range(w):
        if tmp[j] == "snuke":
            num2alpha = lambda c: chr(c+64)
            print(num2alpha(j + 1) + str(i + 1))

Solution (Python):
h, w = map(int, input().split())
idx_h = None
idx_w = None
for i in range(h):
    words = list(map(str, input().split()))
    for j in range(w):
        if words[j] == 'snuke':
            idx_h = i
            idx_w = j
        else:
            pass
ans = str(chr(97 + idx_w).upper()) + str(idx_h+1)
print(ans)

Solution (Python):
import sys
from string import ascii_uppercase as A2Z

input = sys.stdin.readline


def main():
    H, W = map(int, input().split())
    S = [None] * H
    for i in range(H):
        S[i] = input().split()

    for h in range(H):
        for w in range(W):
            if S[h][w] == "snuke":
                ans = A2Z[w] + str(h + 1)

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
h, w = map(int, input().split())
ans = ''
for i in range(h):
    for j, k in enumerate(input().split()):
        if k == 'snuke':
            ans = '%s%d' % (chr(65+j), i+1)
print(ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, W = MAP()
S = [input().split() for _ in range(H)]

for i, s in enumerate(S):
    if "snuke" in s:
        print(ascii_uppercase[s.index("snuke")], i+1, sep="")
        break

Solution (Python):
H,W=map(int,input().split())
cnt=0
import  sys
def num2alpha(num):
    if num<=26:
        return chr(64+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(64+num%26)

for i in range(H):
    cnt+=1
    row=list(map(str,input().split()))
    if row.count('snuke') !=0:
        f=row.index('snuke')+1
        ff=num2alpha(f)
        print(ff,cnt,sep='')
        sys.exit()
print('No')

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    H,W=MI()
    ans=0
    for i in range(H):
        s=input().split()
        if "snuke" in s:
            n=s.index("snuke")
            ans=(chr(n+97)).upper()+str(i+1)
            
    print(ans)
    

main()

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

Solution (Python):
h, w = map(int, input().split())
s = [[] for _ in range(h)]
resh, resw = 0, 0
for i in range(h):
    s[i] = input().split()
    if 'snuke' in s[i]:
        resh, resw = i + 1, s[i].index('snuke')

print(chr(65 + resw), resh, sep='')

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

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

Solution (Python):
def main():
    H, W = map(int, input().split())
    masu = [input().split() for i in range(H)]
    alpha = "abcdefghijklmnopqrstuvwxyz"

    for i in range(H):
        for j in range(W):
            if masu[i][j] == "snuke":
                print(alpha[j].upper() + str(i+1))
                exit()

if __name__ == "__main__":
    main()

Solution (Python):
from string import ascii_uppercase
h,w = map(int,input().split())
a,b = "",0
for i in range(h):
    s = list(map(str,input().split()))
    for j in range(w):
        if s[j] == "snuke":
            b = ascii_uppercase[j]
            a = i+1
print(b+str(a))

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

for i in range(h):
  s = input().split()
  for j in range(w):
    if s[j] == "snuke":
      col = chr(65+j)
      print(col+str(i+1))
      exit()

Solution (Python):
h, w = map(int, input().split())
ans = ''
for i in range(h):
  s = list(map(str, input().split()))
  if 'snuke' in s:
    ans += str(i + 1)
    a = s.index('snuke') + 1
    abc = {1: 'A', 2: 'B', 3: 'C', 4: 'D', 5: 'E', 6: 'F', 7: 'G', 8: 'H', 9: 'I', 10: 'J', 11: 'K', 12: 'L', 13: 'M', 14: 'N', 15: 'O', 16: 'P', 17: 'Q', 18: 'R', 19: 'S', 20: 'T', 21: 'U', 22: 'V', 23: 'W', 24: 'X', 25: 'Y', 26: 'Z'}
    ans = abc[a] + ans
print(ans)

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

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

alpha = [chr(i) for i in range(65, 65+26)]

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

Solution (Python):

n, m = map(int, input().split())
matr = []
for i in range(n):
	matr.append(list(input().split()))
for i in range(n):
	for j in range(m):
		if matr[i][j] == "snuke":
			print(chr(ord('A')+j)+str(i+1))
			break

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

mat=[input().split() for l in range(h)]

col=ord('A')

i=0
while i<h:

    j=0
    while j<w:
        
        if mat[i][j] == 'snuke':
            print(chr(col+j)+str(i+1))
            break

        j+=1

    i+=1

Solution (Python):
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))
            break
    else:
        continue
    break

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

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

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

Solution (Python):
H, W = map(int, input().split())
S = [None for _ in range(H)]
for i in range(H):
  S[i] = list(input().split())
for i in range(H):
  for j in range(W):
    if S[i][j] == 'snuke':
      print(chr(ord('A')+j)+str(i+1))
      exit()

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

table = [[] for _ in range(H)]

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
h, w = map(int, input().split())
l = [input().split() for _ in range(h)]
for b, i in enumerate(l, 1):
    if "snuke" in i:
        print(chr(65 + i.index("snuke"))+str(b))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(str, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


H, W = MAP()

S = [LIST() for _ in range(H)]

for i in range(H):
	for j in range(W):
		if S[i][j] == "snuke":
			print(ascii_uppercase[j], i+1, sep="")
			exit()

Solution (Python):
def resolve():
    H, W = map(int, input().split())
    S = []
    abs = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    for i in range(H):
        s = list(input().split())
        S.append(s)
    for p in range(H):
        for q in range(W):
            if S[p][q] == "snuke":
                print(abs[q]+str(p+1))
resolve()

Solution (Python):
def resolve():
    H, W = map(int, input().split())
    S = []
    abs = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    for i in range(H):
        s = list(input().split())
        S.append(s)
    for p in range(H):
        for q in range(W):
            if S[p][q] == "snuke":
                print(abs[q]+str(p+1))
resolve()

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

for h in range(H):
    for w in range(W):
        if S[h][w] == 'snuke':
            sw = chr(ord('A') + w)
            sh = str(h+1)
            print(sw+sh)

Solution (Python):
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'
    
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
 
YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase

read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
input=lambda: sys.stdin.readline().rstrip()

class Tree:
    def __init__(self,inp_size=None,ls=None,init=True,index=1):
        self.LCA_init_stat=False
        self.ETtable=[]
        if init:
            if ls==None:
                self.stdin(inp_size,index=index)
            else:
                self.size=len(ls)+1
                self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def stdin(self,inp_size=None,index=1):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1,index=index)
        return
    
    def listin(self,ls,index=0):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def dfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def bfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.size
        v[x]=root_v
        while q:
            c=q.popleft()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def parent(self,x):
        return self.dfs(0,func=lambda pr,prv,nx,dist:pr,root_v=-1)
 
    def topological_sort(self,x):  
        tps=[]
        q=deque([x])
        v=[None]*self.size
        v[x]=0
        while q:
            c=q.popleft()
            tps.append(c)
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=0
        return tps
 
    def EulerTour(self,x):
        q=deque()
        q.append(x)
        self.depth=[None]*self.size
        self.depth[x]=0
        self.ETtable=[]
        self.ETdepth=[]
        self.ETin=[-1]*self.size
        self.ETout=[-1]*self.size
        cnt=0
        while q:
            c=q.pop()
            if c<0:
                ce=~c
            else:
                ce=c
                for nb,d in self.edges[ce]:
                    if self.depth[nb]==None:
                        q.append(~ce)
                        q.append(nb)
                        self.depth[nb]=self.depth[ce]+1
            self.ETtable.append(ce)
            self.ETdepth.append(self.depth[ce])
            if self.ETin[ce]==-1:
                self.ETin[ce]=cnt
            else:
                self.ETout[ce]=cnt
            cnt+=1
        return
    
    def LCA_init(self,root):
        self.EulerTour(root)
        self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
        
        self.LCA_init_stat=True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            self.LCA_init(root)
        xin,xout=self.ETin[x],self.ETout[x]
        yin,yout=self.ETin[y],self.ETout[y]
        a=min(xin,yin)
        b=max(xout,yout,xin,yin)
        id_of_min_dep_in_et=self.st.query_id(a,b+1)
        return self.ETtable[id_of_min_dep_in_et]
 
    def __str__(self):
        return  str(self.edges)
 
    def show(self):
        if all([all([d==1 for nd,d in edge]) for edge in self.edges]):
            print( [[nd for nd,d in edge] for edge in self.edges] )
        else:
            print(self)
 
class SparseTable: 
    def __init__(self,ls,init_func=min,init_idl=float('inf')):
        self.func=init_func
        self.idl=init_idl
        self.size=len(ls)
        self.N0=self.size.bit_length()
        self.table=[ls[:]]
        self.index=[list(range(self.size))]
        self.lg=[0]*(self.size+1)
        
        for i in range(2,self.size+1):
            self.lg[i]=self.lg[i>>1]+1
 
        for i in range(self.N0):
            tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
            tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
            self.table+=[tmp]
            self.index+=[tmp_id]
    
    
    def query(self,l,r):
        if r>self.size:r=self.size
        
        N=self.lg[r-l]
        return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
    
    
    def query_id(self,l,r):
        if r>self.size:r=self.size
        
        N=self.lg[r-l]
        a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
        if self.table[0][a]==self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))]):
            b=a
        return b
    
    
    def right_bound(self,pos,x):
        k=(self.size-pos).bit_length()
        for j in range(k)[::-1]:
            nx=pos+(1<<j)
            if nx<n and self.query(pos,nx+1)<=x:
                pos+=(1<<j)
        return pos
    
    
    def left_bound(self,pos,x):
        k=pos.bit_length()
        for j in range(k)[::-1]:
            nx=pos-(1<<j)
            if 0<=nx and self.query(nx,pos+1)<=x:
                pos-=(1<<j)
        return pos
 
    def __str__(self):
        return str(self.table[0])
 
    def print(self):
        for i in self.table:
            print(*i)
 
show_flg=False
show_flg=True
ans=0


n,m=LI()
for i in rep(n):
    s=input().split()
    for j in rep(m):
        if s[j]=='snuke':
            ans=string.ascii_uppercase[j]+str(i+1)


print(ans)

Solution (Python):
h,w=map(int,input().split())
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":
            a=i+1
            b=j+1
            break
b=chr(65+b-1)
ans=b+str(a)
print(ans)

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
def main():

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

    G = [input().split() for k in range(H)]
    S = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    for k in range(H):
        for l in range(W):
            if G[k][l] == "snuke":
                print(S[l]+str(k+1))
                exit(0)
if __name__ == '__main__':
    main()

Solution (Python):
H, W = map(int, input().split())
S = [input().split() for _ in range(H)]
for r, row in enumerate(S):
    for c, s in enumerate(row):
        if s == "snuke":
            print(chr(ord('A') + c) + str(r + 1))
            exit()

Solution (Python):
h,w = map(int,input().split())
l = [list(map(str,input().split())) for i in range(h)]
m = [chr(i) for i in range(ord('A'),ord('Z'))]

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