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>
int main() {
  int n = 3, k = 2;
  int i, j, m;
  char str[2502] = {0};
  char subStr[51] = "aba";
  char temp[51];
  temp[0] = 0;
  scanf("%d%d", &n, &k);
  scanf("%s", subStr);
  strcat(str, subStr);
  if (k == 1) {
    printf("%s", str);
    return 0;
  }
  for (i = 1; str[i]; i++) {
    if (str[i] == subStr[0] && temp[0] == 0) {
      for (j = 0; str[i + j]; j++) {
        if (str[i + j] != subStr[j]) {
          break;
        }
      }
      if (!str[i + j]) {
        for (m = 0; subStr[m + j]; m++) {
          temp[m] = subStr[m + j];
        }
        temp[m] = 0;
      }
    }
  }
  if (temp[0] == 0) {
    strcpy(temp, subStr);
  }
  for (i = 1; i <= k - 1; i++) {
    strcat(str, temp);
  }
  printf("%s", str);
  return 0;
}