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>
const int inf = 1e9 + 7;
const int maxn = 2005;
using namespace std;
char ma[maxn], mb[maxn];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  string s, p;
  cin >> s;
  p = s;
  int q = s.size() / 2;
  for (int i = 1; i < s.size(); i++) {
    string t = s.substr(i);
    string k = s.substr(0, s.size() - i);
    if (k == t) {
      p = s.substr(s.size() - i);
      break;
    }
  }
  cout << s;
  for (int i = 1; i < k; i++) {
    cout << p;
  }
  return 0;
}