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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

H,W=MAP()
grid=[None]*H
for i in range(H):
    grid[i]=input().split()
for i in range(H):
    for j in range(W):
        if grid[i][j]=='snuke':
            print(chr(j+65)+str(i+1))
            exit()

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

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

Solution (Python):
H,W=map(int,input().split())
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']
a=b=''
for i in range(H):
  l2=list(map(str,input().split()))
  for j in range(W):
    if l2[j]=='snuke':
      a=l[j]
      b=str(i+1)
print(a+b)

Solution (Python):
H,W = map(int,input().split())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
k = ''
for i in range(H):
    s = list(input().split())
    if s.count('snuke')>0:
        k = alp[s.index('snuke')]+str(i+1)
print(k)

Solution (Python):

H, W = map(int, input().split())
table = []
for _ in range(H):
    table.append(list(input().split()))
alp = [chr(i) for i in range(65, 65+26)]
for i in range(H):
    for j in range(W):
        if table[i][j] == "snuke":
            print(alp[j] + str(i+1))
            break

Solution (Python):

A=[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)]
for h in range(H):
    for w in range(W):
        if S[h][w]=='snuke':
            print(A[w]+str(h+1))

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

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

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

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

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

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

Solution (Python):

H,W = [int(i) for i in input().split()]
s = [[j for j in input().split()] for i in range(H)]

for h in range(H):
    for w in range(W):
        if s[h][w] == "snuke":
            row = chr(ord('A')+w)
            print(row+str(h+1))

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

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

for i in range(H):
    row = src[i]
    if 'snuke' in row:
        j = row.index('snuke')
        print(chr(ord('A') + j) + str(i+1))
        exit()

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

Solution (Python):
n, m = map(int,input().split())
for i in range(n):
    row = input().split()
    if 'snuke' in row:
        print(chr(ord("A")+row.index('snuke')), i+1, sep='')

Solution (Python):

def itoa(i):
    if i==0:
        return "a"
    elif i==1:
        return "b"
    elif i==2:
        return "c"
    elif i==3:
        return "d"
    elif i==4:
        return "e"
    elif i==5:
        return "f"
    elif i==6:
        return "g"
    elif i==7:
        return "h"
    elif i==8:
        return "i"
    elif i==9:
        return "j"
    elif i==10:
        return "k"
    elif i==11:
        return "l"
    elif i==12:
        return "m"
    elif i==13:
        return "n"
    elif i==14:
        return "o"
    elif i==15:
        return "p"
    elif i==16:
        return "q"
    elif i==17:
        return "r"
    elif i==18:
        return "s"
    elif i==19:
        return "t"
    elif i==20:
        return "u"
    elif i==21:
        return "v"
    elif i==22:
        return "w"
    elif i==23:
        return "x"
    elif i==24:
        return "y"
    elif i==25:
        return "z"


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

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

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

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

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

for h in range(H):
    S = list(map(str, input().split()))
    if 'snuke' in S:
        ind = S.index('snuke')
        ans = abc[ind:ind + 1] + str(h+1)
        print(ans)
        break

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

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


for row in list_prob:
    for col in row:
        
        if col == "snuke":
            num_row = list_prob.index(row)
            num_col = row.index(col)
alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

print(alphabet[num_col] + str(num_row+1))

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

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

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

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

a = []
for i in range(H):
    Si = input().split()
    a += Si
a1 = a.index('snuke')
a2 = int(a1) % W
a3 = int(a1) // W
print(str(chr(65 + a2)) + str(a3 + 1))

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

a = []
for i in range(H):
    Si = input().split()
    a += Si

n = a.index("snuke")
print(chr(ord('A') + n % W) + str(1 + n // W))

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

for i in range(H):
    Si = input().split()
    if key in Si:
        j = Si.index(key)
        ans = chr(ord('A') + j)
        ans += str(i + 1)

print(ans)

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

for i in range(H):
    Si = input().split()
    for j in range(W):
        if Si[j] == "snuke":
            ans = chr(ord('A') + j)
            ans += str(i + 1)

print(ans)

Solution (Python):
n, m = map(int, raw_input().split())
for i in range(n):
    s = raw_input().split()
    for j in range(len(s)):
        if s[j] == 'snuke':
            print chr(j + ord('A')) + str(i + 1)

Solution (Python):
n, m = map(int, raw_input().split())
for i in range(n):
    s = raw_input().split()
    for j in range(len(s)):
        if s[j] == 'snuke':
            print chr(j + ord('A')) + str(i + 1)

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

for i in range(h):
  row = l[i]
  if 'snuke' in row:
    print('{}{}'.format(chr(row.index('snuke')+65),i+1))
    break

Solution (Python):
def read2():
	return map(int, raw_input().split())
def read1():
	return raw_input().split()

h, w = read2()
for i in xrange(h):
	s = read1()
	for j in xrange(w):
	    if s[j] == "snuke":
	        print "%c%d" % (65 + j, i+1)

Solution (Python):
h, w = map(int, raw_input().split())
S = [raw_input().split() for i in xrange(h)]
for i in xrange(h):
    for j in xrange(w):
        if S[i][j] == "snuke":
            print "%s%d" % ("ABCDEFGHIJKLMNOPQRSTUVWXYZ"[j], i+1)

Solution (Python):


def solve():
    h, w = map(int, input().split())
    for i in range(h):
        s = input().strip().split()
        for j in range(w):
            if s[j] == "snuke":
                return chr(ord("A") + j) + str(i + 1)

print(solve())

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

Solution (Python):
from sys import exit, setrecursionlimit
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

setrecursionlimit(1000000)

(H, W) = reads()

for j in range(1, H+1):
  s = input().split()
  if "snuke" in s:
    i = s.index("snuke")
    print(chr(ord('A')+i) + str(j)); exit()

Solution (Python):
h, w = map(int, raw_input().split())
S = [raw_input().split() for i in xrange(h)]
for i in xrange(h):
    for j in xrange(w):
        if S[i][j] == "snuke":
            print "%s%d" % ("ABCDEFGHIJKLMNOPQRSTUVWXYZ"[j], i+1)

Solution (Python):
from string import ascii_uppercase
H, W = [int(i) for i in 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("{}{}".format(ascii_uppercase[w], h+1))

Solution (Python):



from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
from __future__ import unicode_literals

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

H, W = map(int, input().split())
for i in range(H):
    s = input()
    if 'snuke' in s:
        for w, a in zip(s.split(), alphabet):
            if w == 'snuke':
                print("{}{}".format(a, i+1))

Solution (Python):

import string
h, w = map(int, input().split())
for y in range(h):
    ps = input().split()
    for x, p in zip(string.ascii_uppercase, ps):
        if p == 'snuke':
            print(x + str(y+1))

Solution (Python):
import sys
sys.stdin.readline()


for i, line in enumerate(sys.stdin.readlines()):
    for j, s in enumerate(line.split()):
        if s == 'snuke':
            
            print(chr(ord('A')+j)+str(i+1))
            sys.exit()

Solution (Python):
import string
H, W = map(int, input().split())
table = [input().split() for _ in range(H)]
for h in range(H):
    for w in range(W):
        if table[h][w] == "snuke":
            c1 = string.ascii_uppercase[w]
            print(c1 + str(h + 1))
            exit()

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

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