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 n, k;
char s[60];
char ss[3000];
bool judge(int j) {
  for (int i = j, k = 0; i < n; k++, i++)
    if (s[i] != s[k]) return false;
  return true;
}
int main() {
  scanf("%d %d", &n, &k);
  scanf("%s", &s);
  for (int i = 0; i < n; i++) {
    ss[i] = s[i];
  }
  int p2 = 0;
  for (int i = 1; i < n; i++) {
    if (judge(i)) {
      p2 = n - i;
      break;
    }
  }
  if (p2 == 0) {
    for (int i = 0; i < k; i++) {
      for (int j = 0; j < n; j++) {
        cout << s[j];
      }
    }
    cout << endl;
  } else {
    for (int i = 0; i < n; i++) {
      cout << s[i];
    }
    for (int i = 0; i < k - 1; i++) {
      for (int j = p2; j < n; j++) {
        cout << s[j];
      }
    }
    cout << endl;
  }
  return 0;
}