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 mod = 998244353;
const long long int inf = 1e12;
const long long int N = 1e9 + 5;
long long int solve(long long int fu) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, k;
  cin >> n >> k;
  string second;
  cin >> second;
  long long int h = -1;
  for (long long int i = n - 1; i >= 1; i--) {
    bool flag = true;
    for (long long int j = 0; i + j < n; j++) {
      if (second[j] != second[i + j]) {
        flag = false;
      }
    }
    if (flag) {
      h = i;
    }
  }
  if (h != -1) {
    cout << second;
    for (long long int i = 0; i < k - 1; i++) {
      for (long long int j = (n - h); j < n; j++) {
        cout << second[j];
      }
    }
  } else {
    for (long long int i = 0; i < k; i++) {
      cout << second;
    }
  }
  return 0;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t) {
    solve(t);
    t--;
  }
  return 0;
}