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.*;
import java.util.StringTokenizer;

public class A_mnogo_odinakovyh_slov {

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

        // read input data
        MyScanner sc = new MyScanner();
        int n = sc.nextInt();
        int k = sc.nextInt();

        String t = sc.nextLine();
        String result = "";

        int index = 0;
        for (int i = 0; i < n ; i++) {
            if (t.endsWith(t.substring(0, i))) {
                index = i;
            }
        }

        String sub = t.substring(0, n - index);
        for (int i = 0; i < k - 1; i++) {
            print(sub);
        }
        print(t);

        exit();
    }


    static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    static void println(Object o) {
        pr.println(o);
    }

    static void print(Object o) {
        pr.print(o);
    }

    static void exit() throws IOException {
        pr.close();
        System.exit(0);
    }

    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}