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,k=list(map(int,input().split()))
s=input()
g=len(set(s))
s3=(s[:g])*(int(n/g))
if s3==s:
    print(s+((s[:g])*(k-1)))
else:
    x=""
    y=""
    i=0
    j=len(s)-1
    t=[]
    while i<n:
        x+=s[i]
        y=s[j]+y
        if x==y:
            t.append(x)
        i+=1
        j-=1
    if len(t)>1:
        t.pop()
    h=len(t[-1])
    m=""
    flag=0
    for l in range(n):
        if l<h:
            pass
        else:
            flag=1
            m+=s[l]
    if flag==0:
        m=s
    f=m*(k-1)
    print(s+f)