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:
x = input()
x = x.split()
n = int(x[0])
k = int(x[1])
s = input()
pos = 0
for i in range(0,len(s)):
  for j in range(i+1,len(s)):
    ii = 0
    jj = j
    while(jj < len(s) and s[ii] == s[jj]):
      ii = ii + 1
      jj = jj + 1
    if(jj == len(s)):
      pos = j
      break
  if(pos != 0):
    break
if(pos == 0):
  pos = len(s)
print(s,end = '')
for i in range(0,k-1):
  for j in range(len(s)-pos,len(s)):
    print(s[j],end = '')
print()