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() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  int max_ans = 0;
  for (int i = 1; i < n; i++) {
    int j = i;
    int f = 0;
    int j1 = 0;
    while (j < n) {
      if (s[j] != s[j1]) {
        f = 1;
        break;
      }
      j++;
      j1++;
    }
    if (f == 0) {
      max_ans = j1;
      break;
    }
  }
  string ans;
  ans = s;
  string a2;
  for (int i = max_ans; i < n; i++) {
    a2 += s[i];
  }
  for (int i = 0; i < k - 1; i++) {
    ans += a2;
  }
  cout << ans << "\n";
  return 0;
}