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:

i1 = input()
i2 = input()

i1 = i1.split(" ")
tam = int(i1[0])
repl = int(i1[1])


lv=0

for i in range(1, tam+1):
    
    cutOri = i2[:tam-int(i)]
    cutPast = i2[:i]
    
    nCad = cutOri+cutPast

    if nCad == i2 and i != tam:
        lv = i
    

nfinal = i2
for j in range(1,repl):
    part = i2[lv:]
    nfinal = nfinal+part

print(nfinal)