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;
const long long N = 2e5 + 10;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, i, j;
  string s, t = "";
  cin >> n >> k >> s;
  for (i = 1; i < n; i++) {
    string t1 = "", t2 = "";
    for (j = i; j < n; j++) t1 += s[j];
    for (j = 0; j <= (n - i - 1); j++) t2 += s[j];
    if (t1 == t2) {
      for (j = (n - i); j < n; j++) t += s[j];
      break;
    }
  }
  if (i == n) {
    for (i = 1; i <= k; i++) cout << s;
    return 0;
  }
  cout << s;
  for (i = 2; i <= k; i++) cout << t;
  return 0;
}