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

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

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

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

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

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

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

Solution (Python):
from string import ascii_uppercase


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

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

        h += 1
        w = 0


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

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

    main(h, w, s)

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

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

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

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

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

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

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

print(ans)

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

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

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

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

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

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

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

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

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

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

num2alpha = lambda c: chr(64+c)

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

Solution (Python):

alphabets ='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
h, w = map(int, input().split())
s = [[s for s in input().split()] for _ in range(h)]

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

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

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

'''

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

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


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

Solution (Python):


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

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

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

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
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()

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

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

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

ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 






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

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

Solution (Python):


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

hx = 0
wx = 0

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

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

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

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(ord('A')+j),i+1,sep='')

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

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

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

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

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

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

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

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

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

if __name__=='__main__':
    main()

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

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

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

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

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

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

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

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

a = 0
b = 0

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

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

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

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

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

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

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

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

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

Solution (Python):

h, w = [int(s) for s in input().split()]
s = [[s for s in input().split()] for _ in range(h)]
characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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

Solution (Python):

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

Solution (Python):
from string import ascii_uppercase


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

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

        h += 1
        w = 0


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

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

    main(h, w, s)

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

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

Solution (Python):
from sys import stdin

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

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

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

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque




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

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






if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

Solution (Python):



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




ah = 0
aw = 0

alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

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





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

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

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':
            row=i
            col=j
            break

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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(ord('A')+j), i+1, sep='')

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

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

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

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('{}{}'.format(chr(j + ord('a')).upper(), i + 1))
            exit()

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(97 + j).upper() + str(i + 1))
			exit()

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

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

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

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

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

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

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

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