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:
#int x, y, i = 1, j, subLen = 1, count, iF, jF, flag, m = 1
i=1
m=1
try:
	iStr = input()
	t = input()
	ips = iStr.split()
	n = int(ips[0])
	k = int(ips[1])
except:
	k=0
if k>0 and n>0 and n==len(t):
	j = n - 1
	flag = 0
	#for count = 0; count < x/2; i++, j--, count++:*/
	for count in range(0, n-1):
		if t[:i] == t[j:]:
			iF = i
			flag = 1
		i += 1
		j -= 1
	final = t
	if flag == 1:
		#char final[n + (i + 1)*(k-1)];*/
		for m in range(0, k-1):
			final += t[iF:]
	else:
		for m in range(0,k-1):
			final += t
	print(final)