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;
public class B
{
       public static void main(String args[])
       {
              Scanner sc = new Scanner(System.in);
              int n=sc.nextInt();
              int k=sc.nextInt();   
              String t=sc.next();
              String a=t;
              String ans=t;
              boolean flag=true;
              for(int i=0;i<n;i++)
              {
                     flag=true;
                     //int temp=i;
                     int k1=0;
                     for(int j=i+1;j<n;j++)
                     {
                            if(t.charAt(j)!=a.charAt(k1))
                            {
                                   flag=false;
                                   //i=temp+1;
                                   break;
                            }
                            k1++;
                     }
                     if(flag==true)
                     {
                            for(int j=1;j<k;j++)
                                   ans=ans+t.substring(k1);
                            break;
                     }
              }
              System.out.println(ans);
       }
}