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 int N = 3e5 + 5;
const int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
int main() {
  int n, k;
  string s;
  cin >> n >> k >> s;
  k--;
  string ans = s, tmp = s;
  tmp.erase(tmp.begin() + 0);
  while (!tmp.empty()) {
    string x = s;
    while (x.size() > tmp.size()) {
      x.pop_back();
    }
    if (x == tmp) break;
    tmp.erase(tmp.begin() + 0);
  }
  if (!tmp.empty()) {
    string con = "";
    for (int i = tmp.size(); i < s.size(); i++) {
      con += s[i];
    }
    while (k > 0) {
      ans += con;
      k--;
    }
  } else {
    while (k > 0) {
      ans += s;
      k--;
    }
  }
  cout << ans << '\n';
  return 0;
}