CodeForces A. Many Equal Substrings

http://codeforces.com/contest/1029/problem/A

 

You are given a string k.

Let's define a substring of some string s[l…r].

Your task is to construct such string t.

It is guaranteed that the answer is always unique.

Input

The first line of the input contains two integers t and the number of substrings.

The second line of the input contains the string n lowercase Latin letters.

Output

Print such string 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 <bits/stdc++.h>
using namespace std;

int N, M;
string s;

int main() {
    scanf("%d%d", &N, &M);
    cin >> 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;
}