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 ManyEqualSubstrings506 {

	public static void main(String[] args)
	{
		Scanner S = new Scanner(System.in);
		int n = S.nextInt();
		int k = S.nextInt();
		String str = S.next();
		
		//System.out.println(str);
		//System.out.println(n+" "+k);
		
		int c=0;
		int z=str.length()-1;
		for(int i=1;i<str.length();i++)
		{
			if(str.substring(0,i).equals(str.substring(z, str.length())))
			{
				c=i;
				
			}
			
			z--;
		}
		//System.out.println(c);
		
		String substr = str.substring(c);
		//System.out.println(substr);
		
		String res = new String();
		res=res+str;
		for(int i=1;i<k;i++)
		{
			res+=substr;
		}
		
		System.out.println(res);
	}
}