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,m=map(int,input().split())
stringnow=input()
indexstart=0
answer=0
for i in range(len(stringnow)):
    tmp=i
    countletter=0
    indexstart=0
    while(stringnow[tmp]==stringnow[indexstart] and tmp!=0):
        tmp+=1
        indexstart+=1
        if(tmp==len(stringnow)):
            break
    if(tmp==len(stringnow)):
        break
if(tmp==len(stringnow)):
    linkedstring=stringnow[indexstart:]
else:
    linkedstring=stringnow
answer=stringnow
for i in range(m-1):
    answer+=linkedstring
print(answer)