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:
invoer = list(map(int, input().split(" ")))
tekst = input()
uitvoer = ""
dubbels = -1

if invoer[0] == 1:
    for i in range(0,invoer[1]):
        uitvoer = uitvoer + tekst
else:
    for i in range(0,invoer[0]-1):
        if tekst[0:1+i] == tekst[invoer[0]-i-1:invoer[0]]:
            dubbels = i+1
            uitvoer = tekst[0:dubbels]
    for i in range(0,invoer[1]):
        if dubbels != -1:
            uitvoer = uitvoer + tekst[dubbels:invoer[0]]
        else:
            uitvoer = uitvoer + tekst


print(uitvoer)