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())
s_list = list(s)
s_list2 = []
for x in s_list:
    s_list2.append(x)
s_list2.pop(0)
s_list.pop()
ile = 0
for x in range(0,len(s_list2),+1):
    if s_list == s_list2:
        ile = len(s_list)
    else:
        s_list2.pop(0)
        s_list.pop()
s_w = ''
for y in range(ile,len(s),+1):
    s_w += s[y]
s_wyn = s
for z in range(0,k-1,+1):
    s_wyn+=s_w
print s_wyn