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:
//package codeforcesQuestions;
import java.io.InputStreamReader;
import java.io.BufferedReader;
public class cdf506a
{
	public static void main(String args[])throws Exception
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String s=br.readLine();
		String ss[]=s.split(" ");
		int n=Integer.parseInt(ss[0]);
		int k=Integer.parseInt(ss[1]);
		s=br.readLine();
		int i;
		for(i=1;i<n;i++)
		{
			if(s.substring(i).equals(s.substring(0,n-i)))
			break;
		}
		if(i!=n)
		{
			String temp=s.substring(n-i);
			//System.out.print(i);
			System.out.print(s);
			for(i=1;i<k;i++)
				System.out.print(temp);
		}
		else
		{
			for(i=0;i<k;i++)
				System.out.print(s);
		}
	}
}