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:
t = input()
t = t.split(" ")
n = int(t[0])
k = int(t[1])
r = input()
ind = 0
q = 0
for i in range (1,n):
    q = 0
    isi = 1
    ind = i
    for j in range(i,n):
        if r[j] == r[q]:
            q = q+1
        else:
            isi = 0
            q = 0
            break
    if isi == 1:
        ind = i
        break
#print( q )
for c in range (1,k):
    for j in range (q,n):
        r = r + r[j]
print(r)