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

public class first {

    public static void main(String args[]) {

        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        String str = in.next();
        int index = n;
        boolean check = false;
        for(int i=1;i<n;i++){
            int see = 0;
            for(int j=i;j<n;j++){
                if(str.charAt(j)==str.charAt(see)){
                    see++;
                    check = true;
                }else{
                    check = false;
                    break;
                }

            }
            if(check){
                index = i;
                break;
            }
        }
      //  System.out.println(index);
        String ans = str;
        String rem = "";
        for(int i=(n-1-index)+1;i<n;i++){
            rem += str.charAt(i);
        }
       //System.out.println(rem);
        for(int i =0;i<k-1;i++){
            ans+=rem;
        }
        System.out.println(ans);

    }

}