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;
void Fast() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
inline int RD() {
  int i;
  cin >> i;
  return i;
}
inline float RF() {
  float i;
  cin >> i;
  return i;
}
inline double RDO() {
  double i;
  cin >> i;
  return i;
}
inline string RS() {
  string i;
  cin >> i;
  return i;
}
inline long long Rll() {
  long long i;
  cin >> i;
  return i;
}
inline bool super(long long n) {
  int x4 = 0, x7 = 0;
  while (n != 0) {
    int x = n % 10;
    if (x == 7)
      x7++;
    else
      x4++;
    n /= 10;
  }
  return (x4 == x7) ? true : false;
}
int A1[1000];
int arr[200004];
int main() {
  Fast();
  int n = RD(), k = RD();
  string t = RS();
  int x = 0;
  for (int i = 1; i < t.size(); i++) {
    if (t.substr(i) == t.substr(0, t.size() - i)) {
      x = n - i;
      break;
    }
  }
  cout << t;
  for (int i = 0; i < k - 1; i++) cout << t.substr(x);
}