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() {
  int n, kk;
  cin >> n >> kk;
  char t[n];
  cin >> t;
  char arr[n * kk], sub[n];
  int i = 0, c, j = 0;
  for (i = 0; i < n; i++) arr[i] = t[i];
  i = 1;
  c = 1;
  while (1) {
    int k = 0, p = 1;
    while (i + k < n) {
      if (arr[i + k] == t[k]) {
        k++;
        continue;
      } else {
        p = 0;
        break;
      }
    }
    if (p == 0) {
      i++;
      continue;
    }
    if (p == 1) {
      while (k < n) {
        sub[j] = t[k];
        j++;
        k++;
      }
      break;
    }
  }
  cout << t;
  int y;
  for (c = 1; c < kk; c++)
    for (y = 0; y < j; y++) cout << sub[y];
  return 0;
}