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;
struct node {
  int id, num, color;
};
int const inf = 0x3f3f3f3f;
int const maxn = 1e2 + 10;
int n, k, f;
string s, sub;
int main() {
  cin >> n >> k >> sub;
  s = sub;
  for (int i = n - 1; i > 0; i--) {
    if (s[i] == s[0]) {
      int dis = n - i;
      if (sub.substr(0, dis) == sub.substr(i, dis)) {
        s = sub.substr(dis, n - dis);
      }
    }
  }
  for (int i = 1; i < k; i++) {
    sub += s;
  }
  cout << sub;
  return 0;
}