Codeforces Round #506 (Div. 3) A. Many Equal Substrings

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

题目大意：给出长为ｎ的字符串，构造出最短的包含ｋ个给出字符串子串的字符串。

思路：本来打算构造一个类似ＫＭＰ的ｎｅｘｔ数组的数组，但是看着数据量似乎并不大就写了一个有回溯的ＡＣ了，懒了一下。

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
char c[55];
int main()
{
    int n,k;
    cin>>n>>k;
    cin>>c;
    int t=0;
    for(int i=1;i<n;i++)
    {
        if(c[i]==c[t])
        {
            t++;
        }
        else
        {
            i=i-t;
            t=0;
        }
    }
    for(int i=0;i<t;i++)
        cout<<c[i];
    for(int i=0;i<k;i++)
    {
        for(int j=t;j<n;j++)
            cout<<c[j];
    }
    cout<<endl;
}