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.Scanner;

public class Test {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String str1 = scan.nextLine();
        String s = scan.nextLine();
        scan.close();

        String[] numbers = str1.split(" ");
        Integer N = Integer.parseInt(numbers[0]);
        Integer M = Integer.parseInt(numbers[1]);

        int temp = 0;
        for (int i = 0; i < N; i++) {
            if (s.substring(0, i).equals(s.substring(N - i, N)) )
                temp = i;
        }


        for (int i = 1; i < M; i++)
            System.out.print(s.substring(0, N - temp));
        System.out.println(s);
    }
}