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 long long N = 1e6 + 5;
const long long mod = 1e9 + 7;
void solve() {
  long long n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  long long kc = 0;
  long long i = 0;
  for (long long j = i + 1; j < s.length(); j++) {
    if (s[i] == s[j]) {
      long long I = i, J = j;
      while (s[I] == s[J] and J < n) {
        kc++;
        I++;
        J++;
      }
      if (J != n) {
        kc = 0;
      } else {
        break;
      }
    }
  }
  string s1 = s.substr(0, s.length() - kc);
  for (long long i = 0; i < k - 1; i++) {
    cout << s1;
  }
  cout << s;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}