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>
char str[55];
int main() {
  int n, k;
  int max = 0;
  scanf("%d %d", &n, &k);
  scanf("%s", str);
  for (int cnt = 0; cnt < n; cnt++) {
    int i;
    for (i = 0; i < cnt; i++) {
      if (str[i] != str[n - cnt + i]) break;
    }
    if (i == cnt) {
      if (max < cnt) {
        max = cnt;
      }
    }
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < n - max; j++) {
      printf("%c", str[j]);
    }
  }
  for (int j = 0; j < max; j++) {
    printf("%c", str[n - max + j]);
  }
  printf("\n");
  return 0;
}