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;
inline void boost() {
  ios_base::sync_with_stdio();
  cin.tie(0);
  cout.tie(0);
}
const long long MAXN = 1e5 + 123;
const long long INF = 1e9 + 123;
const double pi = 3.14159265359;
int main() {
  boost();
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  string cntr = s;
  for (int i = 1; i <= k - 1; i++) {
    int sum = 0;
    for (int j = 0; j < cntr.size(); j++) {
      int qw = cntr.size() - j;
      if (qw < n && cntr.substr(j, qw) == s.substr(0, qw)) {
        sum = 1;
        for (int z = qw; z < n; z++) {
          cntr += s[z];
        }
        break;
      }
    }
    if (!sum) {
      cntr += s;
    }
  }
  cout << cntr;
  exit(0);
}