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() {
  string s1;
  int x = 0, m, n;
  cin >> m >> n;
  cin >> s1;
  for (int i = 0; i < m; i++) {
    if (s1.substr(0, i) == s1.substr(m - i, i)) x = i;
  }
  if (x == 0) {
    for (int i = 0; i < n; i++) cout << s1;
  } else {
    cout << s1;
    string s2 = s1.substr(x);
    for (int i = 1; i < n; i++) cout << s2;
  }
}