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.Scanner;
import java.util.HashSet;
public class A
{
       public static void main(String args[])
       {
              Scanner sc=new Scanner(System.in);
              int n=sc.nextInt();
              int k=sc.nextInt();
              String s=sc.next();
              String s1=s;
              int t=0;
              for(int j=t+1;j<s1.length();j++)
              {
                            if(s1.charAt(t)==s1.charAt(j))
                            {
                                   t++;
                            }
                            else
                            {
                                   if(t>0)
                                   {
                                          j=j-t;       
                                   }
                                   t=0;
                            }
              }
              for(;k>1;)
              {
                     s=s+s1.substring(t);
                     k--;
              }
              System.out.println(s);
              //System.out.println(s.length());
       }
}