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:
x = input()
n, k = x.split(' ')
n = int(n)
k = int(k)
t = input()
rmax = 0
for x in range(1, n):
    cf = 0
    for i in range(0, x):
        if (t[i] != t[n-1-x+i+1]):
            cf = 1
    if (cf == 0):
        rmax = x
res = t
rmax = n-rmax
for x in range(0, k-1):
    for i in range(0, rmax):
        res = res+t[n-1-rmax+i+1]

print(res)