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

Solution:
#!/usr/bin/python
# -*- coding: utf-8 -*-

def get_raw():
	raw = raw_input().split(" ")
	n = int(raw[0])
	k = int(raw[1])
	s = raw_input()
	return n, k, s

def get_substr(s):
	size = len(s)
	l = size - 1
	while l:
		if s[0:l] == s[size-l:size]:
			return s[l:size]
		l-=1
	return s

if __name__ == '__main__':
	n, k, s = get_raw()
	substr = get_substr(s)
	for i in range(0,k-1):
		s += substr
	print s