Problem: You are given a string t consisting of n lowercase Latin letters and an integer number k.

Let's define a substring of some string s with indices from l to r as s[l ... r].

Your task is to construct such string s of minimum possible length that there are exactly k positions i such that s[i ... i + n - 1] = t. In other words, your task is to construct such string s of minimum possible length that there are exactly k substrings of s equal to t.

It is guaranteed that the answer is always unique.

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 50) — the length of the string t and the number of substrings.

The second line of the input contains the string t consisting of exactly n lowercase Latin letters.

Output

Print such string s of minimum possible length that there are exactly k substrings of s equal to t.

It is guaranteed that the answer is always unique.

Examples

Input

3 4
aba


Output

ababababa


Input

3 2
cat


Output

catcat

Solution (in PYTHON3):

Solution:
# def count(s, t):
# 	cnt = 0
# 	for i in range(len(s)-len(t)):
# 		contains = True
# 		for j in range(len(t)):
# 			if s[i] != s[j]:
# 				contains=False
# 				break
# 		if contains:
# 			cnt+=1
# 	return cnt

n, k = [int(i) for i in input().split()]

t = input()

s = t

found = 0
for idx in range(len(t)-1):
	if t[:idx+1] == t[len(t)-1-idx:]:
		if idx+1 > found:
			found = idx+1

t = t[found:]

for i in range(k-1):
	s+=t

print(s)

# while count(s,t) < k:


# end = len(t) -1
# start = 0
# while end> start and t[start] == t[end]:
# 	start+=1
# 	end-=1

# print(start,end)

# # s = t[:end+1]
# s = t
# t = t[start:]


# for i in range(1,k):
# 	s = s + t
# 	# print(s)
# 	# if count(s, t) == k:
# 	# 	print(s)
# 	# 	break

# print(s)