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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long i, j, n, t = 1, k = 0, cnt = 0, mini = LLONG_MAX, maxi = LLONG_MIN,
                     ans = 0;
  long long m;
  string s;
  cin >> n >> k;
  cin >> s;
  string p = "";
  for (i = s.length() - 1; i > 0; i--) {
    p = s[i] + p;
    if (p == s.substr(0, p.length())) {
      maxi = p.length();
      cnt = i;
    }
  }
  p.clear();
  for (i = 0; i < maxi; i++) p += s[i];
  string out = "";
  out += s;
  if (k == 1) return cout << out, 0;
  if (maxi == LLONG_MIN) {
    for (i = 0; i < k - 1; i++) out += s;
    return cout << out, 0;
  }
  string temp = "";
  for (i = maxi; i < s.length(); i++) temp += s[i];
  for (i = 0; i < k - 1; i++) {
    out += temp;
  }
  return cout << out, 0;
  return 0;
}