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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/**
 * Created by NubbY
 */
public class A {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tk;
        tk = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(tk.nextToken());;
        int k = Integer.parseInt(tk.nextToken());;
        String s = reader.readLine();
        int max = 0;
        for (int i = 1; i < s.length(); i++) {
            if (s.substring(0, i).equals(s.substring(s.length() - i))) {
                max = i;
            }
        }
        String sub = s.substring(max);
        StringBuilder out;
        out = new StringBuilder(s);
        if (k == 1) {
            System.out.println(s);
            return;
        }
        while (k > 1) {
            k--;
            out.append(sub);
        }
        System.out.println(out.toString());
    }
}