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 ProblemA {

	private static Scanner input;

	static String get_token(String s) {

		String token = new String(s);
		String t = new String(s);

		do {
			s = s.substring(1, s.length());
			t = t.substring(0, t.length() - 1);
		} while (s.length() > 0 && s.compareTo(t) != 0);

		return token.substring(s.length(), token.length());
	}

	public static void main(String[] args) {

		input = new Scanner(System.in);

		int k;
		String t;

		input.nextInt();
		k = input.nextInt();
		input.nextLine();
		t = input.nextLine();

		StringBuilder solution = new StringBuilder(t);
		String token = get_token(t);

		for (int i = 0; i < k - 1; i++) {
			solution.append(token);
		}

		System.out.println(solution);

	}

}