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 int N = 10000;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t, n, m, k;
char str[N];
int main() {
  scanf("%d%d", &n, &k);
  scanf("%s", str);
  int cnt = 0;
  int len = strlen(str);
  int flag = 0;
  for (int i = 1; i < len; i++) {
    int temp = i;
    int top = 0;
    while (str[top] == str[temp]) {
      top++;
      temp++;
      if (temp == len) {
        flag = top;
        break;
      }
    }
    if (flag) break;
  }
  if (flag) {
    for (int j = 0; j < flag; j++) printf("%c", str[j]);
    for (int i = 1; i <= k; i++)
      for (int j = flag; j < len; j++) printf("%c", str[j]);
  } else {
    for (int i = 1; i <= k; i++) printf("%s", str);
  }
  cout << endl;
  return 0;
}