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

Solution:
#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int main() {
  fast();
  long long int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, t, type, sum1 = 0,
                sum2 = 0, sum = 0, flag = 0, mini = 0, pos = 0, add = 0,
                count = 0, a1 = 0, b1 = 0, c1 = 0, end = 0, index = 0;
  long long int n, h, m, i, j, g, p, q, r, l, u, v, k, x, y, z, x1, x2, y1, y2,
      gcdc, centre = 0, maxi = 0, med = 0, start = 0, ans = 0, mid = 0, lo = 0,
            hi = 0, rem = 0, one;
  string s, s1, s2, s3, s4, s5, s6, s7, s8, s9;
  {
    cin >> n >> t >> s;
    k = 0;
    for (i = 0; i < n - 1; i++) {
      if (s.substr(0, i + 1) == s.substr(n - i - 1)) k = i + 1;
    }
    cout << s;
    for (i = 1; i < t; i++) cout << s.substr(k);
  }
  return 0;
}