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;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k;
  cin >> n >> k;
  string t;
  cin >> t;
  bool equal = true;
  for (int i = 0; i < n - 1; i++) {
    if (t[i] != t[i + 1]) equal = false;
  }
  if (equal) {
    char c = t[0];
    cout << t;
    for (int i = 0; i < k - 1; i++) {
      cout << c;
    }
  } else {
    string temp;
    for (int i = 0; i < n - 1; i++) {
      if (t.substr(0, i + 1) == t.substr(n - i - 1)) temp = t.substr(0, i + 1);
    }
    int idx = temp.length();
    temp = t.substr(idx);
    for (int i = 0; i < k - 1; i++) t += temp;
    cout << t << '\n';
  }
  return 0;
}