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:
k=list(map(int,input().split()))
j=k[0]-1
l=(input())
s=list(l)
m=set(s)
t=0
c=0
if(len(m)==k[0]):
    print((l)*(k[1]))
elif(len(m)==1):
    print(l+(k[1]-1)*l[0])
else:
    for i in range(1,k[0]-1):
        if(l[0:i]==l[(k[0]-i):]):
            c=i
    if(c!=0):
        print(l+(l[c:j+1])*(k[1]-1))
    else:
        print((l)*(k[1]))