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>
long long poww(long long x, long long y) {
  long long res = 1;
  x %= 1000000007;
  for (; y; y >>= 1) {
    if (y & 1) res = res * x % 1000000007;
    x = x * x % 1000000007;
  }
  return res;
}
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, i, j, k, c;
  string s, t;
  cin >> n >> c;
  cin >> t;
  s = t;
  for (i = 1; i < n; ++i)
    if (s[i] == s[0]) {
      j = 1;
      k = 1;
      while (i + j < n) {
        if (s[i + j] != s[j]) {
          k = 0;
          break;
        }
        j++;
      }
      if (k == 1) {
        break;
      }
    }
  if (k == 0) {
    while (c--) cout << s;
  } else {
    i = n - i;
    for (j = 0; j < i; ++j) cout << s[j];
    t = "";
    for (; i < n; ++i) t += s[i];
    while (c--) cout << t;
  }
  return 0;
}