Problem:


Score : 100 points

Problem Statement

There is a grid with H rows and W columns.

The square at the i-th row and j-th column contains a string S_{i,j} of length 5.

The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.

Exactly one of the squares in the grid contains the string snuke. Find this square and report its location.

For example, the square at the 6-th row and 8-th column should be reported as H6.

Constraints

1≦H, W≦26

The length of S_{i,j} is 5.

S_{i,j} consists of lowercase English letters (a-z).

Exactly one of the given strings is equal to snuke.

Input

The input is given from Standard Input in the following format:

H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}

Output

Print the labels of the row and the column of the square containing the string snuke, with no space inbetween.

Sample Input 1

15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake

Sample Output 1

H6

Sample Input 2

1 1
snuke

Sample Output 2

A1



Sample input:
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake


Sample output:
H6

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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='')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding:utf-8 -*-

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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))

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
    #include<iostream>
    #include<stdio.h>
    //#include <bits/stdc++.h>
    #include<vector>
    #include<float.h>
    #include<iomanip>
    #include<algorithm>
    #include<string>
    #include<cstring>
    #include<math.h>
    #include<cmath>
    #include<sstream>
    #include<set>
    #include<map>
    #include<queue>
    #include<cassert>
    #include<cmath>
    #include<cstdint>
     
    #define INF 1e9
    #define rep(i,n)for(int i=0;(i)<(int)(n);i++)
    #define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
    #define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
    #define vec(type,n) vector<type>(n)
    #define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
    #define ALL(a)  (a).begin(),(a).end()
    #define chmin(a, b) a = min(a, b)
    #define chmax(a, b) a = max(a, b)
    #define pb push_back
     
    using namespace std;
    using ll = long long int;
    using Graph = vector<vector<int>>;
    using P = pair<ll, ll>;
     
const int MOD = 1e9 + 7;
const ll ZER = 0;


int main(){
    int h, w;
    cin >> h >> w;
    vector<vector<string>> s(h, vector<string>(w));
    rep(i, h)rep(j, w){
        cin >> s[i][j];
        if(s[i][j] == "snuke"){
            cout << (char)('A' + j) << i + 1 << endl;
        }
    }
    
}

Submission status: Runtime Error

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

    if flag:
        break

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
A = 'ABCDEFGHIJKLMN'
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)

Submission status: Runtime Error

Solution code:
H,W=map(int,input().split())
S=[input().split() for i in range(H)]
columns=["A","B","C","D","E","F","G","H","I","J"]
for h in range(H):
    for w in range(W):
        if S[h][w]=="snuke":
            print(columns[w]+str(h+1))

Submission status: Runtime Error

Solution code:
H,W=map(int,input().split())
S=[input().split() for i in range(H)]
columns=["A","B","C","D","E","F","G","H"]
for h in range(H):
    for w in range(W):
        if S[h][w]=="snuke":
            print(columns[w]+str(h+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
h,w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]
al = list("ABCDEFGHIJ")
i = -1
for v in s:
  i+=1
  if "snuke" in v:
    print(al[s[i].index("snuke")]+str(i+1))
    exit()

Submission status: Runtime Error

Solution code:
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(w):
    for k in range(h):
        if l[j][k]=='snuke':
            print(str(alp[j])+str(k+1))
print(l)

Submission status: Runtime Error

Solution code:
h,w = map(int,input().split())
S = [map(int,input().split()) for _ in range(h)]
for i,j in range():
  if S[i][j] == 'snuke':
    print((i)*w+j+1)
    break

Submission status: Runtime Error

Solution code:
h,w = map(int,input().split())
S = [input() for _ in range(h*w)]
for i in range(h*w):
  if S[i] == 'snuke':
    print(i+1)

Submission status: Runtime Error

Solution code:
h,w = map(int,input().split())
S = [int(input()) for _ in range(h*w)]
for i in range(h*w):
  if S[i] == 'snuke':
    print(i+1)

Submission status: Runtime Error

Solution code:
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']

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

Submission status: Runtime Error

Solution code:
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(ans + str(i+1))
    break

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H, W = map(int, input().split())
alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
S = [list(map(int, 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))

Submission status: Runtime Error

Solution code:
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,75)]
for r in range(h):
    for c in range(w):
        if a[r][c]=="snuke":
            print(p[c]+str(r+1))
            break

Submission status: Runtime Error

Solution code:
H, W = map(int, intput().split())
M = [input().split() for _ in range(H)]
for i, r in enumerate(M):
  for j, c in enumerate(r):
    if c == 'snuke':
      print("%s%d" %(chr(ord('A')+j), i))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a,b=(int(x) for x in input().split())
for i in range(a):
  for j in range(b):
    try:
      c = input()
      if c=='snuke':
        d = num2alpha(i)
        e = str(d)+j
        print(e)
    except EOFError:
        break

Submission status: Runtime Error

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

a = int(input())
b = int(input())
for i in range(a):
  for j in range(b):
    c = input()
    if c=='snuke':
      d = num2alpha(i)
      e = str(d)+j
      print(e)

Submission status: Runtime Error

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

a = int(input())
b = int(input())
for i in range(a):
  for j in range(b):
    c = input()
    if c=='snuke':
      d = num2alpha(i)
      e = d+j
      print(e)

Submission status: Runtime Error

Solution code:
H,W = map(int,input().split())
alp = 'ABCDEFGHIJ'
for i in range(H):
  for j,s in enumerate(input().split()):
    if s == 'snuke':
      print(alp[j]+str(i+1))
      exit()

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
ls = ["ABCDEFGHIJKLMNOPQRSTUVWXYZ"]
x = [list(input().split()) for i in range(a)]
for i in range(a):
  for j in range(b):
    if x[a][b] == "snuke":
      print(ls[a]+str(b+1))
      break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

A = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for h in range(H):
  for w in range(W):
    if state[h][w] == 'snuke':
      ans = A[w] + str(h+1)
print(ans)

Submission status: Runtime Error

Solution code:
# 解説を観たのでそれをやってみるバージョン
# （最初に解いたやつは愚直に毎回最大値を求めていた（なんかしらんけど通った））
n = int(input())
cur = 0
target = 0
for i in range(1, n + 1):
    if i + cur >= n:
        target = i
        break
    cur += i

remove_num = sum([i for i in range(1, target + 1)]) - n
for i in range(1, target + 1):
    if i != remove_num:
        print(i)

Submission status: Runtime Error

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J"]
    h, w = list(map(int, input().rstrip('\n').split()))
    for i in range(h):
        s = list(map(str, input().rstrip('\n').split()))
        for j in range(w):
            if s[j] == "snuke":
                print(d[j] + str(i+1))
                exit()


if __name__ == '__main__':
    slove()

Submission status: Runtime Error

Solution code:
H, W  = map(int,input().split())
S = [list(map(str,input().split())) for i in range(H)]
char = "ABCDEFGHIJ"
for i in range(H):
    for j in range(W):
        if S[i][j] == "snuke":
            tmp = [i,j]
ans = str(char[tmp[1]]) + str(tmp[0]+1)
print(ans)

Submission status: Runtime Error

Solution code:
import re, sys
input = sys.stdin.readline

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

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

for i in range(h):
  col = my_index(input().split(), 'snuke')
  if col == False:
    row = i + 1
    break

alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
print(alphabet[col] + str(row))

Submission status: Runtime Error

Solution code:
# cf16-finalA - Where's Snuke?
def main():
    h, w = list(map(int, input().rstrip().split()))
    A = [input().rstrip().split() for _ in range(h)]
    S = "ABCDEFGHIJ"
    for i in range(h):
        for j in range(w):
            if A[i][j] == "snuke":
                print(S[j], i + 1, sep="")
                return


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
# cf16-finalA - Where's Snuke?
def main():
    h, w = list(map(int, input().rstrip().split()))
    A = [input().rstrip().split() for _ in range(h)]
    S = "ABCDEFGHIJ"
    for i in range(h):
        for j in range(w):
            if A[i][j] == "snuke":
                print(S[j], i + 1, sep="")
                return
    else:
        print(A)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
a, b = ap(int, input().split())
for i in range(a):
  for j in range(b):
    if input() == "snuke":
      print(alph[j] + str(i + 1))
      exit()

Submission status: Runtime Error

Solution code:
h,w=map(int,input().split())
disp=['A','B','C','D','E','F','G','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))

Submission status: Runtime Error

Solution code:
H,W = map(int,input().split())
L = []
A = ['A','B','C','D','E','F','G','H','I','J']
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))

Submission status: Runtime Error

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

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('{}{}'.format(chr(row.index('snuke')+65),i+1))
            exit()

Submission status: Runtime Error

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

for i in range(h):
    maps.append(list(map(int,input().split())))
for i in range(h):
    for j in range(w):
        if maps[i][j] == "snuke":
            print(i+1)
            exit()

Submission status: Runtime Error

Solution code:
h,w = map(int,input().split())
maps = []
for i in range(h):
    maps.append(list(map(int,input().split())))
for i in range(h):
    for j in range(w):
        if maps[i][j] == "snuke":
            print('{}{}'.format(chr(row.index('snuke')+65),i+1))
            exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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(list(map(int,input().split())))

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define FOR(I,X,Y) for(int (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(int (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long ll;
using namespace std;

int main(){
  int H,W;
  string S;
  cin >> H >> W;
  FOR(i,1,H+1)for(char c = 'A';c < 'A'+W;c++){
    cin >> S;
    if(S == "snuke"){
      cout << c << i << endl;
      return 0;
    }
  }
}

Submission status: Runtime Error

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

def findSnuke(H, W):
    for i in range(H):
        row = input().split()
        for j in range(W):
            if row[j] == "snuke":
                return [i, j]


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

alphabet = "ABCDEFGHIJKLMNOPQRSTU"
col, row = findSnuke(H, W)

print(alphabet[row] + str(col+1))

Submission status: Runtime Error

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

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

alphabet = "ABCDEFGHIJKLMNOPQRSTU"

for i in range(H):
    row = input().split()
    for j in range(W):
        if row[j] == "snuke":
            print(alphabet[j] + str(i+1))
            break

Submission status: Runtime Error

Solution code:
N, M = [int(i) for i in input().split()]
X = [0] * (10 ** 5)
# X = [0] * (10)
for i in map(int, input().split()):
    X[i] += 1
Y = [sum(X[i::M]) for i in range(M)]
ans = Y[0] // 2
Y[0] = 0
for i in range(1, M//2+M%2):
    j = M - i
    tmp = min(Y[i], Y[j])
    ans += tmp
    Y[i] -= tmp
    Y[j] -= tmp
for i, n in enumerate(X):
    j = i % M
    if Y[j] < 2 or n < 2:
        continue
    tmp = min(Y[j]-Y[j]%2, n-n%2)
    ans += tmp // 2
    Y[j] -= tmp
print(ans)

Submission status: Runtime Error

Solution code:
import bisect
N = int(input())
S = tuple(map(lambda x: (x**2+x)//2, range(5000)))
while N > 0:
    i = bisect.bisect_left(S, N)
    N -= i
    #print(i, N, S)
    print(i)

Submission status: Runtime Error

Solution code:
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" % ("ABCDEFGHIJ"[j], i+1)