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:
import sys
n,k=list(map(int,sys.stdin.readline().strip().split()))
s=sys.stdin.readline()

sadd=list(s)
sadd.pop(len(sadd)-1)

# print(s[n-1])
s=list(s)
i=1
x="".join(s[n-i:n])

y="".join(sadd[0:i])
# print(x,y)
f=0
# smallestRepeating=""
# largestRepeating=""
for i in range(1,n):
    # i=i+1
    x="".join(s[n-i:n])
    y="".join(sadd[0:i])
    
    if(f==0 and x==y):
        smallestRepeating=y
        f=1
    if(x==y):
        largestRepeating=y

    # print(x,y)
# print(largestRepeating,smallestRepeating)



# print(l)
countD=0
if(f):
    l=len(smallestRepeating)
    for z in range(0,n,l):
        d="".join(s[z:z+l])
        # print(d)
        if(d==smallestRepeating):
            countD=countD+1
        
    op=smallestRepeating
    # print(op)
    # print(countD)
    while(countD>1):
        countD=countD-1
        op=op+smallestRepeating
        # print(op)

    

    # sadd="".join(sadd[len(op)-1:n])

s="".join(s)
s=s[0:n]
k=k-1

if(f):
    if(op==s):
        sadd=smallestRepeating
    else:
        sadd="".join(sadd[len(largestRepeating):n])
else:
    sadd=s
# print(s,sadd)
while(k):
    k=k-1
    s=s+sadd
    
print(s)