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:
n, k = [int(c) for c in input().split()]
s = input()

flag = 1
first = s[0]
for i in range(1,n):
    if s[i] != first:
        flag = 0
        break

str_added = ""

c = 1 
if(flag == 0):
    while(c < n):
        if(s[0] == s[c]):
            if(s[c:n] == s[0:n-c]):
                str_added = s[n-c:n]
                break
            else:
                c+=1
        else:
            c+=1

else:
    str_added = first    

if(len(str_added) == 0):
    str_added = s

for i in range(k-1):
    s += str_added

print(s)