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, T;
  scanf("%i %i", &N, &T);
  char string[N];
  scanf("%s", string);
  int startIndex = -1;
  for (int i = 1; i < N; i++) {
    bool met = true;
    for (int j = 0; j < N - i; j++) {
      if (string[i + j] != string[j]) {
        met = false;
        break;
      }
    }
    if (met) {
      startIndex = i;
      break;
    }
  }
  if (startIndex == -1) {
    for (int i = 0; i < T; i++) {
      printf("%s", string);
    }
    exit(0);
  }
  char toPrint[startIndex + 1];
  for (int i = 0; i < startIndex; i++) {
    toPrint[i] = string[i];
  }
  toPrint[startIndex] = '\0';
  for (int i = 0; i < T - 1; i++) {
    printf("%s", toPrint);
  }
  printf("%s", string);
  exit(0);
}