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

public class Olimp {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int k=in.nextInt();
        char a[]=new char[n];
        char f[]=new char[n];
        String t=in.next();
        for (int i = 0; i < n; i++) {
            a[i]=t.charAt(i);
            f[i]=a[i];
        }
        List<Character> d=new ArrayList<>();
        int m=0;
        one:for (int i = 1; i < n; i++) {
            boolean flag=true;
            int j=i;
            m=0;
            while(flag){
                if(f[j]==a[m]){
                    j++;
                    m++;
                }
                else{
                    break;
                }
                if(j==n){
                    break one;
                }
                
            }
        }
        System.out.print(t);
        for (int j = 0; j < k-1; j++) {
            for (int i = m; i < n; i++) {
                System.out.print(a[i]);
            }
        }

        
        
   
    }
}