Find a Word

WORDS = []
table = []
n, k = map(int, input().split())
wordLen = 2*n - 1

#print(n,k)


def rec(y, x, curWord = ""):
	if x >= n or y >= n: return
	curWord += table[y][x]
	#print(curWord, y, x)
	if y == n - 1 and x == n - 1:
		WORDS.append(curWord)
		return
	rec(y, x + 1, curWord)
	rec(y + 1, x, curWord)

for _ in range(n):
	table.append(input().rstrip())
	#print(table)
rec(0,0)
##print(sorted(WORDS))
print(sorted(WORDS)[k - 1])

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED