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.PrintWriter;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter rasl = new PrintWriter(System.out);
        int n=sc.nextInt();
        int k=sc.nextInt();
        String t=sc.next();
        int c=n;
        int c1=1;
        String p=t;
        String s1=t.substring(0,c-1);
        String s2=t.substring(c1,n);
        while(c>1){
            s1=t.substring(0,c-1);
            s2=t.substring(c1,n);
            if(s1.equals(s2)){
                p=t.substring(c-1,n);
                break;
            }
            c1++;
            c--;
        }
        System.out.print(t);
        for (int i =k-1; i>=1 ; i--) {
            System.out.print(p);
        }
        rasl.close();
    }
}