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 ManySubStr {
	
	public static String getManySubstr(String input, int k){
		int len=input.length();
		
		int i=1,j=0, m=1;
		while(i<len){
			//k=i;
			if(input.charAt(i)==input.charAt(j)){
				if(i==len-1)
					break;
				i++;
				j++;
			}
			else{
				m++;
				i=m;
				j=0;
			}
		}
		String sub=input;
		if(i<len)
			sub=input.substring((i-m)+1);
		StringBuilder sb=new StringBuilder();
		sb.append(input);
		for(int l=1;l<k;l++)
			sb.append(sub);
		return sb.toString();	
	}

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		int k=sc.nextInt();
		sc.nextLine();
		
		System.out.println(ManySubStr.getManySubstr(sc.nextLine(),k));
	}

}