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:
m,n= map(int, input().split())
s=input()
length=len(s)

k,flag,start,end=0,0,-1,-1
copy=s

i=1
while(i<length):
    if(s[i]==copy[k] and flag==0):
        flag=1
        start=i
        end=i
        k+=1
    elif(s[i]==copy[k] and flag==1):
        end=i
        k+=1
    elif(s[i]!=copy[k] and flag==1):
        i=start
        start=-1
        end=-1
        k=0
        flag=0 
    i+=1   

#print(length-start)
print(s,end='')

if(flag==1):
    for i in range(n-1):
        print(s[length-start:length],end='')        

else:
    for i in range(n-1):
        print(s,end='')