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;
int main() {
  int n, i, j, p, k = 0, f = 0, cnt = 0, mncnt = 0;
  cin >> n >> p;
  string a;
  cin >> a;
  for (i = 1; i < n; i++) {
    k = 0;
    cnt = 0;
    if (a[i] == a[0]) {
      f = 0;
      j = i;
      if (j == n) {
        cnt = 1;
        f = 1;
        break;
      }
      while (a[j] == a[k]) {
        cnt++;
        if (j == n - 1) {
          f = 1;
          break;
        }
        j++;
        k++;
      }
      if (f == 1) break;
    }
  }
  vector<char> c;
  for (i = 0; i < n; i++) {
    c.push_back(a[i]);
  }
  string b = a;
  int m = n;
  int q = 1;
  while (q < p) {
    for (i = cnt; i < n; i++) {
      m++;
      c.push_back(a[i]);
    }
    q++;
  }
  for (i = 0; i < m; i++) cout << c[i];
  return 0;
}