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:
s=input()
s=s.split()
for i in range(2):
    s[i]=int(s[i])
n=s[0]
k=s[1]
t=input()
count=0
for i in range(1,len(t)):
    if t[i]==t[0]:
        count=count+1
        j=0
        while i<(len(t)-1) and j<(len(t)-1) :
            j=j+1
            i=i+1
            if t[i]!=t[j]:
                count=0
                break
            else:
                count=count+1
        if count>0:
            break
z=t[count:len(t)]
q=''
q=t+z*(k-1)
print(q)