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.lang.*;
import java.io.*;
import java.io.BufferedInputStream;
import java.io.IOException;
public final class many{
    public static void main(String[] args)
    {
        Scanner scan = new Scanner(System.in);
        int n  = scan.nextInt();
        int k = scan.nextInt();
        scan.nextLine();
        String s = scan.nextLine();
        EqualStrings(s,n,k);        
    }
   public static void EqualStrings(String s, int n,int k)
    {
        int i = 0,j = 1;
        for(;j< s.length();)
        {
            int run = s.indexOf(s.charAt(0), j);
            if(run == -1)
                break;
            while(run < s.length())
            {
                if(s.charAt(i) != s.charAt(run))
                {   
                    i = 0;
                    j++;
                    break;
                }
                i++;
                run++;
            }
            if(run == s.length())
                break;
        }
        String copy = s.substring(i,n);
        String result = new String(s);
        for(int res = 1; res < k;res++)
            result += copy;

        System.out.println(result);
    }
    

}