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 pom(long long int n, long long int p,
                  long long int c = 1000000007) {
  if (!p)
    return 1;
  else if (p % 2)
    return (pom(n, p - 1, c) * (n % 1000000007)) % c;
  else {
    long long int te = pom(n, p / 2, c);
    return (te * te) % c;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int pos = n;
    for (int i = 1; i < n; i++) {
      string a = s.substr(i, n - i);
      if (!s.compare(0, n - i, a)) {
        pos = i;
        break;
      }
    }
    cout << s;
    for (int j = 0; j < k - 1; j++)
      for (int i = n - pos; i < n; i++) cout << s[i];
  }
  return 0;
}