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
Copy
3 4 aba
Output
Copy
ababababa
Input
Copy
3 2 cat
Output
Copy
catcat
代码如下：
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n,k;
char s[50];
vector<char>C;
int main()
{
scanf("%d%d",&n,&k);
scanf("%s",s);
for (int i=0;i<n;i++)
C.push_back(s[i]);
int num=0;
for (int i=0;i<n;i++)
{
int len=n-i;
int flag=0;
for (int j=0;j<i;j++)
{
if(s[len+j]!=s[j])
{
flag=1;
break;
}
}
if(!flag)
num=i;
}
for (int i=0;i<k-1;i++)
{
for (int j=num;j<n;j++)
C.push_back(s[j]);
}
for (int i=0;i<C.size();i++)
printf("%c",C[i]);
printf("\n");
return 0;
}