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 JAVA):

Solution:
import java.util.*;
import java.math.*;
import java.io.*;

public class Main {
  private static BufferedReader br =
      new BufferedReader(new InputStreamReader(System.in));
  private static StringTokenizer st = new StringTokenizer("");

  private static String next() throws IOException {
    while (!st.hasMoreTokens()) {
      st = new StringTokenizer(br.readLine());
    }
    return st.nextToken();
  }

  private static int nextInt() throws IOException {
    return Integer.parseInt(next());
  }

  private static long nextLong() throws IOException {
    return Long.parseLong(next());
  }

  private static double nextDouble() throws IOException {
    return Double.parseDouble(next());
  }

  public static void main(String[] args) throws Exception {
    int n = nextInt();
    int k = nextInt();
    String t = next();

    int inc = n;
    for (int i = 1; i < n; i++) {
      if (t.substring(i).equals(t.substring(0, n - i))) {
        inc = i;
        break;
      }
    }

    StringBuilder sb = new StringBuilder(t);
    for (int i = 1; i < k; i++) {
      sb.append(t.substring(n - inc));
    }

    System.out.println(sb);
  }
}