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.*;
import java.io.*;
public class programA {
   	public static void main(String[] args)throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		String srr = br.readLine();
		String srr2;
		int maxlen = 0;
		for(int i=1;i<n;i++){
			String srr3 = srr.substring(0, i);
			String srr4 = srr.substring(n-i,n);
			int compare = srr4.compareTo(srr3);
		if(compare == 0)
		{
			maxlen=Math.max(maxlen,i);
		}
	    }
		srr2 = srr.substring(maxlen);
		System.out.print(srr);
	    for(int i=0;i<k-1;i++){
	    	System.out.print(srr2);	
	    }
	}

}