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;
long long GCD(long long a, long long b) { return (b == 0 ? a : GCD(b, a % b)); }
long long LCM(long long a, long long b) { return ((a * b) / GCD(a, b)); }
long long BMOD(long long a, long long b, long long m) {
  if (b == 0) return 1;
  long long x = BMOD(a, b / 2, m);
  x = (x * x) % m;
  if (b % 2 == 1) x = (x * a) % m;
  return x;
}
long long MINV(long long a) { return BMOD(a, 100000007 - 2, 100000007); }
struct pt {
  int x, y;
};
char t[55];
int main() {
  int i, j, k, n, subl, p;
  while (scanf("%d %d", &n, &k) != EOF) {
    subl = 0;
    memset(t, 0, sizeof t);
    scanf("%s", &t);
    bool fl = false;
    int l = strlen(t);
    for (i = 1; i < l; i++) {
      fl = true;
      for (j = i, p = 0; j < l; j++, p++) {
        if (t[j] != t[p]) {
          fl = false;
          break;
        }
      }
      if (fl) {
        subl = l - i;
        break;
      }
    }
    printf("%s", t);
    for (i = 2; i <= k; i++) {
      for (j = subl; j < l; j++) {
        printf("%c", t[j]);
      }
    }
    printf("\n");
  }
  return 0;
}