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;
string repeat(string s, int n) {
  string s1 = s;
  for (int i = 1; i < n; i++) s += s1;
  return s;
}
bool allCharactersSame(string s) {
  int n = s.length();
  for (int i = 1; i < n; i++)
    if (s[i] != s[0]) return false;
  return true;
}
int main() {
  string str, strr;
  int n, k, mx = 0;
  cin >> n >> k >> str;
  strr = str;
  reverse(strr.begin(), strr.end());
  for (int i = 1; i < n; i++) {
    string a = str.substr(0, i);
    string b = strr.substr(0, i);
    reverse(b.begin(), b.end());
    if (a == b) mx = max(mx, i);
  }
  strr = str.substr(mx, n - mx);
  while (k > 1) {
    str += strr;
    k--;
  }
  cout << str << endl;
  return 0;
}