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 = 0x3f3f3f3f;
const int mod = (int)1e9 + 7;
const int maxn = (int)1e6 + 5;
using namespace std;
char s[105], t[105];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  scanf("%s", s + 1);
  for (int i = 1; i <= n; i++) t[i] = s[i];
  int cnt = n;
  for (int i = 2; i <= n; i++) {
    bool flag = true;
    for (int j = 1; j <= n - i + 1; j++) {
      if (s[i + j - 1] != t[j]) {
        flag = false;
        break;
      }
    }
    if (flag) {
      cnt = i - 1;
      break;
    }
  }
  for (int i = 1; i <= n; i++) printf("%c", s[i]);
  for (int i = 1; i <= k - 1; i++) {
    for (int j = n - cnt + 1; j <= n; j++) {
      printf("%c", s[j]);
    }
  }
  puts("");
  return 0;
}