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;
const double pi = acos(-1.0);
template <class T>
void R(T &x) {
  cin >> x;
}
void R(int &x) { scanf("%d", &x); }
void R(long long &x) { scanf("%lld", &x); }
void R(double &x) { scanf("%lf", &x); }
void R(char &x) { scanf(" %c", &x); }
void R(char *x) { scanf("%s", x); }
long long _pow(long long a, long long b) {
  long long res = 1ll;
  while (b) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
    b >>= 1;
  }
  return res;
}
int main() {
  int n, k;
  char t[10005], s[10005];
  while (~scanf("%d", &(n))) {
    R(k);
    R(t);
    int len = strlen(t);
    int i, j, flag = 0;
    for (i = 1; i < len; i++) {
      for (j = i; j < len; j++) {
        if (t[j] != t[j - i]) break;
      }
      if (j == len) break;
    }
    j = len;
    for (int o = 1; o < k; o++) {
      for (int x = len - i; x < len; x++) t[j++] = t[x];
    }
    t[j] = '\0';
    puts(t);
  }
  return 0;
}