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 code {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		String nk = sc.nextLine();
		int n = Integer.parseInt(nk.split(" ")[0]);
		int k = Integer.parseInt(nk.split(" ")[1]);
		String t = sc.nextLine();
		
		/*int n = 6;
		int k = 3;
		String t = "aabbaa";*/
		String tmp = "";
		StringBuilder str = new StringBuilder();
		str.append(t);
		for (int i=1; i<=t.length()-1; i++) {
			if(t.substring(0, i).equals(t.substring(t.length()-i,t.length()))) {
				tmp = t.substring(0, i);
			}
		}
		tmp = t.substring(tmp.length());
		for(int j=0; j<k-1; j++) {
			str.append(tmp);
		}
		System.out.println(str);
	}
		
}