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 read() {
  int f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
int n, k;
char s[105];
void init() {
  n = read(), k = read();
  scanf("%s", s);
}
void solve() {
  int st;
  for (st = 1; st < n; st++) {
    int flag = 1;
    for (int j = 0; j < n - st; ++j)
      if (s[st + j] != s[j]) {
        flag = 0;
        break;
      }
    if (flag) break;
  }
  if (st == n) {
    for (int i = 0; i < k; ++i) printf("%s", s);
  } else {
    for (int i = 0; i < k; ++i)
      for (int j = 0; j < st; ++j) putchar(s[j]);
    for (int i = st; i < n; ++i) putchar(s[i]);
  }
  printf("\n");
}
int main() {
  init();
  solve();
  return 0;
}