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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws IOException {
		try { 
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String firstLine = reader.readLine();
		int sLength = Integer.parseInt(firstLine.substring(0, firstLine.indexOf(" ")));
		int k = Integer.parseInt(firstLine.substring(firstLine.indexOf(" ")+1));
		String s = reader.readLine();
		
		int h = sLength;
		for (int i = 1; i < sLength; i++) {
			// abcabc
			String first = s.substring(i, sLength);
			String second = s.substring(0, first.length());
			if (first.equals(second)) {
				h = i;
				break;
			}
		}
		String plusS = s.substring(sLength-h); 
		StringBuilder out = new StringBuilder(s);
		for (int i = 1; i < k; i++) {
			out.append(plusS);
		}
		System.out.println(out);
		
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}