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.FileInputStream;
import java.io.InputStream;
import java.io.InputStreamReader;



public class A1029 {

	public static int pint(String s) {return Integer.parseInt(s);}
	public static long plong(String s) {return Long.parseLong(s);}
	
	public static void main(String[] args) throws Exception {
	
        //InputStream inputStream = new FileInputStream("src/p.in");
        InputStream inputStream = System.in;
        InputStreamReader input = new InputStreamReader(inputStream);
        BufferedReader br = new BufferedReader(input);
        String data[] = br.readLine().split(" ");
        String t = br.readLine();
        int n = t.length();
        int k = pint(data[1]);
        int mid = n/2;
        int common = 0;
        String pos = "?";
        for (int i = 1; i < n; i++) {
        	String aux = t.substring(i);
        	if(t.startsWith(aux)){
        		pos = t.substring(t.length() - i);
        		break;
        	}
		}
        //System.out.println(pos);
        if(pos.equals("?")) {
        	pos = t;
        }
        StringBuilder stringBuilder = new StringBuilder();
        stringBuilder.append(t);
        for(int i = 0 ; i < k -1 ; i++) {
        	stringBuilder.append(pos);
        }
        
        
        System.out.println(stringBuilder.toString());
	}

}