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 double pie = acos(-1);
const double hpie = asin(1);
const double qpie = atan2(1, 1);
const double tpie = 2 * pie;
string vow = "aeiou";
void solve(int test_case) {
  int n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  int p = 1;
  int cnt = -1;
  for (int i = p; i < n; i++) {
    if (s[i] != s[0]) continue;
    ;
    int j = 0;
    for (; i + j < n && s[i + j] == s[j]; j++)
      ;
    if (i + j == n) {
      cnt = j;
      break;
    }
  }
  if (cnt == -1) {
    while (m--) cout << s;
    return;
  }
  string ans = "";
  for (int j = cnt; j < n; j++) ans += s[j];
  m--;
  cout << s;
  while (m--) cout << ans;
  cout << "\n";
  return;
}
int main() {
  int t = 1;
  for (int i = 0; i < t; i++) solve(i);
  return 0;
}