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() {
  long long int n, k;
  cin >> n >> k;
  string a;
  cin >> a;
  long long int i = 0, j = 0, index = 0;
  for (j = 1; j < n; j++) {
    i = 0;
    long long int k = j;
    int flag = 0;
    while (k < n) {
      if (a[i] != a[k]) {
        flag = 1;
        break;
      }
      i++;
      k++;
    }
    if (flag == 1)
      continue;
    else {
      index = j;
      break;
    }
  }
  for (j = 0; j < k; j++) {
    for (i = 0; i < index; i++) {
      cout << a[i];
    }
  }
  for (i = index; i < n; i++) cout << a[i];
  if (index == 0) {
    for (j = 0; j < k - 1; j++)
      for (i = 0; i < n; i++) cout << a[i];
  }
  return 0;
}