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 long long LL_INF = 1e18 + 5;
const int INT_INF = 1e9 + 5;
const int MOD_9 = 1e9 + 7;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long binpow(long long n, long long power) {
  if (power == 0) return 1;
  if (power % 2) return binpow(n, power - 1) * n;
  long long b = binpow(n, power / 2);
  return b * b;
}
unsigned int max_prefix_func(const string s) {
  unsigned int best = 0;
  size_t size = s.length();
  for (size_t i = 1; i < size; i++)
    if (s.substr(0, i) == s.substr(size - i)) best = i;
  return best;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  string t;
  cin >> n >> k >> t;
  unsigned int q = max_prefix_func(t);
  cout << t;
  string m = t.substr(q);
  for (int i = 1; i < k; i++) cout << m;
  return 0;
}