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;
template <typename I>
void _DO(I &&x) {
  cerr << x << endl;
}
template <typename I, typename... T>
void _DO(I &&x, T &&...tail) {
  cerr << x << ", ";
  _DO(tail...);
}
template <typename A, typename B>
ostream &operator<<(ostream &second, const pair<A, B> &p) {
  return second << "(" << p.first << "," << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &second, const vector<T> &c) {
  second << "[ ";
  for (auto it : c) second << it << " ";
  second << "]";
  return second;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n, k;
  string second, t;
  cin >> n >> k;
  cin >> second;
  t = second;
  for (int j = 1; j < n; j++) {
    if (second.substr(j, n - j) == second.substr(0, n - j)) {
      t = second.substr(n - j, j);
      break;
    }
  }
  cout << second;
  for (int i = 1; i < k; i++) cout << t;
  cout << '\n';
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}