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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        AManyEqualSubstrings solver = new AManyEqualSubstrings();
        solver.solve(1, in, out);
        out.close();
    }

    static class AManyEqualSubstrings {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.ni();
            int k = in.ni();
            String t = in.n();
            StringBuilder sb = new StringBuilder(t);
            --k;
            while (k-- > 0) {
                boolean done = false;
                for (int i = sb.length() - n + 1; i < sb.length(); ++i) {
                    //System.out.print(i+" ");
                    if (t.startsWith(sb.toString().substring(i))) {
                        int len = sb.length() - i - 1;
                        //System.out.print("Gl "+t.substring(sb.length()-i));
                        sb.append(t.substring(sb.length() - i));
                        done = true;
                        break;
                    }
                }
                //System.out.println();
                if (!done)
                    sb.append(t);
            }
            out.println(sb);
        }

    }

    static class InputReader {
        BufferedReader br;
        StringTokenizer st;

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

        public InputReader(InputStream inputStream) {
            br = new BufferedReader(new InputStreamReader(inputStream));
        }

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

        public int ni() {
            return Integer.parseInt(n());
        }

    }
}