A. Many Equal Substrings（自己很水）

                                                             A. Many Equal Substrings

You are given a string tt consisting of nn lowercase Latin letters and an integer number kk .

Let's define a substring of some string ss with indices from l to r as s[l…r]s[l…r] .

Your task is to construct such string ss of minimum possible length that there are exactly k positions i such that s[i…i+n−1]=ts[i…i+n−1]=t . In other words, your task is to construct such string ss of minimum possible length that there are exactly kk substrings of ss 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≤501≤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 ss of minimum possible length that there are exactly k substrings of ss equal to t .

It is guaranteed that the answer is always unique.

Examples

Input

Copy

3 4
aba

Output

Copy

ababababa

Input

Copy

3 2
cat

Output

Copy

catcat

很明显这是一个字符串的处理问题，要用到substr来截取字符串，但有可能在一个字符串中有重复的，所以要去重，用下标来索引。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>

using namespace std;

int main()
{
	int n, m;
	string s;
	cin >> n >> m >> s;
	
	int temp;
	for(int i = 0; i < n; i++) if(s.substr(0, i) == s.substr(n-i, i)) temp = i;
	
	for(int i = 1; i < m; i++) cout << s.substr(0, n - temp);
	cout << s << endl;
	return 0;
}