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::sync_with_stdio(NULL);
  cout.tie(NULL);
  cin.tie(NULL);
}
const double pi = 2 * acos(0.0);
const long long oo = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int nn = 1e3 + 15;
int dx[8] = {1, 0, 0, -1, 1, -1, 1, -1};
int dy[8] = {0, 1, -1, 0, -1, 1, 1, -1};
int main() {
  fast();
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  string s1 = "", s2 = "", ans = "";
  for (int i = 0; i < n; i++) {
    s1 += s[i];
    s2.insert(s2.begin(), s[n - i - 1]);
    if (s1 == s2 && ((int)((s1).size())) != n) ans = s1;
  }
  string tmp = s;
  while (((int)((ans).size()))) {
    s.erase(s.begin());
    ans.pop_back();
  }
  cout << tmp;
  k--;
  while (k--) {
    cout << s;
  }
  cout << "\n";
  return 0;
}