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 TaskA {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		String ss = sc.next();
		if (n == 1) {
			for (int i = 0; i < k; i++) {
				System.out.print(ss);
			}
			return;
		}
		if (k == 1) {
			System.out.println(ss);
			return;
		}
		int index = ss.length() - 1;
		for (int i = index; i > 0; i--) {
			if (ss.startsWith(ss.substring(i))) {
				index = i - 1;
			}
		}
		System.out.print(ss);
		if (index == 0) {
			for (int i = 0; i < k - 1; i++) {
				System.out.print(ss.substring(ss.length() - 1));
			}
			return;
		}

		for (int i = 0; i < k - 1; i++) {
			System.out.print(ss.substring(ss.length() - index - 1));

		}

	}
}