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() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int n, k;
  string s;
  cin >> n >> k >> s;
  if (n == 1) {
    cout << s;
    for (int i = 0; i < k - 1; i++) cout << s;
    return 0;
  }
  string suffix = "";
  int maxx = 0;
  for (int i = 1; i < n; i++) {
    string pre = "", suff = "";
    for (int j = 0; j < i; j++) {
      pre += s[j];
      suff += s[n - 1 - j];
    }
    reverse(suff.begin(), suff.end());
    if (suff == pre) {
      suffix = "";
      for (int j = i; j < n; j++) suffix += s[j];
    }
  }
  if (suffix.size() == 0) {
    for (int i = 0; i < k; i++) cout << s;
    return 0;
  }
  cout << s;
  for (int i = 0; i < k - 1; i++) cout << suffix;
}