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






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


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


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




H,W = IL()
D = SLL(H)

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

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

H, W = ri_()
S = [rs_() for _ in range(H)]
for i in range(H):
    for j in range(W):
        if S[i][j] == 'snuke':
            print('ABCDEFGHIJKLMNOPQRSTUVWXYZ'[j] + str(i + 1))

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    H, W = map(int, readline().split())
    alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    for i in range(H):
        S = readline().decode('utf-8').strip().split()
        for j in range(W):
            if S[j]=='snuke':
                ans = alphabet[j] + str(i+1)
                print(ans)
                sys.exit()

if __name__ == '__main__':
    main()

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

Solution (Python):
a, b = map(int, input().split())
A = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ans = ""
for i in range(a):
  t = list(input().split())
  if 'snuke' in t:
    ans += A[t.index("snuke")]
    ans += str(i + 1)
print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
ALPHABET = [chr(i) for i in range(ord('A'), ord('Z') + 1)]


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

    for w in range(W):
        for h in range(H):
            if S[h][w] == "snuke":
                break
        else:
            continue
        break

    print(chr(65 + w) + str(h + 1))


if __name__ == '__main__':
    resolve()

Solution (Python):
import sys
h,w=[int(x) for x in input().rstrip().split()]
l=[]
al=[x for x in "ABCDEFGHIJKLMNOPQRSTUVWXYZ"]
for i in range(h):
  s=[x for x in input().rstrip().split()]
  if "snuke" in s:
    ans=al[s.index("snuke")]+str(i+1)
print(ans)

Solution (Python):
h,w = map(int,input().split())
s = [list(input().split()) for nesya in range(h)]
n = 0
for i in range(h):
  for j in range(w):
    if s[i][j] == 'snuke':
      ai = i
      aj = j
      n += 1
      break
  if n == 1:
    break
print(chr(aj+ord('A'))+str(ai+1))

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    H, W = map(int, input().split())
    S = [input().split() for _ in range(H)]
    for h in range(H):
        for w in range(W):
            if S[h][w] == "snuke":
                ans = chr(ord("A") + w) + str(h + 1)
                print(ans)
                return


if __name__ == "__main__":
    main()

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

Solution (Python):
h, w = map(int, input().split())
ans_h, ans_w = 0, 0
for i in range(h):
    s = [_ for _ in input().split()]
    for j in enumerate(s):
        if j[1] == 'snuke':
            ans_h, ans_w = i, j[0]
            break

ans = chr(65+ans_w)
ans += str(ans_h+1)
print(ans)

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    H,W = map(int, input().split())
    vv = []
    for i in range(H):
        vv.append(list(input().split()))

    for i in range(H):
        for j in range(W):
            if(vv[i][j] == "snuke"):
                print(chr(ord('A') + j),i+1,sep="")


if __name__ == '__main__':
    solve()

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

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

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

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


for i in range(h):
    s = input().split()
    for g in range(w):
        if s[g]=="snuke":
            print(al[g]+str(i+1))

Solution (Python):
from string import*;_,w,*s=open(0).read().split();a,b=divmod(s.index("snuke"),int(w));print(ascii_uppercase[b]+str(a+1))

Solution (Python):
from string import*
h, w, *s = open(0).read().split()
a, b = divmod(s.index("snuke"), int(w))
print(ascii_uppercase[b] + str(a+1))

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

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

Solution (Python):
ALF = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
AZ = {i:ALF[i] for i in range(len(ALF))}
H,W = list(map(int,input().split()))
S = [input().split() for _ in range(H)]
for h in range(H):
    for w in range(W):
        if S[h][w] == 'snuke':
            print(AZ[w]+str(h+1))

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

Solution (Python):
alpha = {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'}
h, w = map(int, input().split())
for i in range(h):
  a = list(input().split())
  for j in range(w):
    if a[j] == 'snuke':
      ans = alpha[j+1] + str(i+1)
      break
print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        H,W=map(int,input().split())
        grid=[list(map(str,input().split())) for _ in range(H)]

        moji='ABCDEFGHIJKLMNOPQRSTUVWXYZ'

        for i in range(H):
            for j in range(W):
                if grid[i][j]=='snuke':
                    return [moji[j],i+1]
    for i in main():
        print(i, end='')
    print()
resolve()

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

num2alpha = lambda c: chr(c+64)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
h, w = map(int, input().split())
r = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M",
     "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"
     ]

for i in range(h):
    s_in = list(input().split())
    judge = "snuke" in s_in
    if judge:
        line = i + 1
        row = r[s_in.index("snuke")]

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

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

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

h,w = na()
co = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']

for i in range(h):
    s = nn()
    if 'snuke' in s:
        j = s.index('snuke')
        print(co[j]+str(i+1))
        exit()

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

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

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

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

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
alp=[s.upper() for s in list('aqwsedrftgyhujikolpmnbvcxz')]
alp.sort()
H,W=map(int,input().split())
S=[input().split() for _ in range(H)]
for i in range(H):
    for j in range(W):
        if S[i][j]=='snuke':
            print(str(alp[j])+str(i+1))

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

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

Solution (Python):
from string import ascii_uppercase

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

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

l = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')

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

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

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

if __name__=='__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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


print(ans)

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

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

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

Solution (Python):

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


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



if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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('%c%d'%('ABCDEFGHIJKLMNOPQRSTUVWXYZ'[j],i+1))
            exit()

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

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

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

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

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

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

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

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

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

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





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

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

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):









import sys



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

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

    s = [0]*h

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

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

if __name__ == '__main__':
    main()