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:
L = [int(i) for i in input().strip().split()]
n = L[0]
k = L[1]

s = input()
flag = 0
i = 0
#if(len(s)%2 ==0):
#    j = len(s)//2
#else:
#    j = len(s)//2 + 1
if(len(s)>=2):
    j=1

    while(True):
        if(i == 0):
            count = j
        if(s[i] == s[j]):
            i+=1
            j+=1
            if(j == len(s)):
                flag = 1
                break
        else:
            i = 0
            j = count+1
        
        if(j == len(s)):
            break
    
    if(flag == 0):
        count = len(s)
    
    x = len(s)-count
    
    str = s[x:]
    
    for i in range(k-1):
        s = s + str
    
    print(s)

else:
    str = s
    for i in range(k-1):
        s = s + str
    
    print(s)