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.*;
public class cdf 
{
	public static void main(String[] args) {
		Scanner ob=new Scanner(System.in);
int n=ob.nextInt();
int k=ob.nextInt();
String t,s;
t=ob.next();int f;
int i,flag=0;if(k==1)
{
	System.out.print(t);
}
else{
for(i=n-1;i>=1;i--)
{
	s=t.substring(0,i);
	if(t.endsWith(s))
	{
     flag=i;
     break;
	}}
if(flag==0)
{for(i=0;i<k;i++)
	System.out.print(t);
}
else
{
		System.out.print(t);
		for(i=0;i<k-1;i++)
	System.out.print(t.substring(flag,n));
}
}
}
}