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 PYTHON):

Solution:
n,k=map(int,raw_input().split())
s=str(raw_input())
from copy import deepcopy
#ans=s+"*"*1000
i=0
p=s[0]
c=0
if n==1:
    print s*k
else:
    c=0
    for i in range(0,n):
        #print s[0:i],s[n-i:n]
        if s[0:i]==s[n-i:n]:
            c=i
    #print c
    #c=0
    #print c

    if 1==1:

        z=s[c:len(s)]
        ans=s
        #print ans
        for i in range(0,k-1):
            ans=ans+z
        print ans