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.io.BufferedReader;
import java.io.InputStreamReader;

public class Solution {

    public static void main(String[] args) throws Exception {

        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        String input_1 = reader.readLine();
        String input_2 = reader.readLine();

        int count = Integer.parseInt(input_1.substring(input_1.indexOf(' ') + 1));

        int s = findSimilarChars(input_2);
        System.out.print(input_2);
        for (int i = 0; i < count - 1; i++) {
            System.out.print(input_2.substring(s));
        }

        reader.close();
    }

    public static int findSimilarChars(String line){
        int result = 0;

        for (int i = 1; i < line.length(); i++){
            if (!line.substring(line.length()-i).equals(line.substring(0, i)))
                continue;
            result = i;
        }


        return result;
    }

}