# CodeForces - 1029A

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<string>
using namespace std;
int main(){
int n,m;
string str;
cin>>n>>m>>str;
int pos=0;
for(int i=0;i<n;i++)
if(str.substr(0,i)==str.substr(n-i,i)) pos=i;
cout<<str;
for(int i=1;i<m;i++)
cout<<str.substr(pos);
cout<<endl;
return 0;
}

08-26 140
08-26 206 03-07 262
02-22 41
08-26 148
03-04 76
03-03 23
03-03 81
11-16 373
10-29 31