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.io.*;
import java.util.*;
import java.util.Map.Entry;
import java.util.concurrent.ThreadLocalRandom;

public class Main {
	
	static BufferedReader br;
	static StringTokenizer st;
	static PrintWriter pw;
	static Scanner console;
	static int n, k;
	static String t;
	
	public static void main(String[] args) throws IOException {
//		br = new BufferedReader(new InputStreamReader(System.in));
//		pw = new PrintWriter(System.out);
//		st = new StringTokenizer(br.readLine());
		console = new Scanner(System.in);
		n = console.nextInt();
		k = console.nextInt();
		console.nextLine();
		t = console.nextLine();
		solved();
	
	}
	
	static void solved() {
		int start = 0;
		for(int i = 1; i < n; i++) {
			if(t.substring(0, i).equals(t.substring(n - i))) start = i;
		}
		System.out.print(t);
		for(int i = 1; i < k; i++)
			System.out.print(t.substring(start));
	}
}