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() {
  long long int t = 1;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  while (t--) {
    long long int i, j, k, m, n, ans = 0, in = 0, k1;
    cin >> n >> k1;
    string s, s2, s3, s1;
    cin >> s;
    cout << s;
    k1--;
    for (i = 1; i < n; i++) {
      j = 0;
      k = i;
      while (s[k] == s[j] && k < n && j < n) {
        k++;
        j++;
      }
      if (k == n) {
        long long int l = n - i;
        for (i = l; i < n; i++) s1 += s[i];
        s2 = s1;
        break;
      }
    }
    if ((int)s1.length() <= 0) s2 = s;
    while (k1--) {
      cout << s2;
    }
  }
  return 0;
}