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>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const long long mod = 1000000000 + 7;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
int main() {
  int n, k;
  int len = 0;
  char ch[1025];
  cin >> n >> k;
  cin >> ch;
  int ok = 1;
  int i;
  for (i = n - 1; i > 0; i--) {
    ok = 1;
    for (int j = 0; j < i; j++) {
      if (ch[j] != ch[n - i + j]) {
        ok = 0;
        break;
      }
    }
    if (ok) break;
  }
  for (int j = 0; j < i; j++) {
    cout << ch[j];
  }
  while (k--) {
    for (int j = i; j < n; j++) {
      cout << ch[j];
    }
  }
  return 0;
}