## Algorithm

E. Anfisa the Monkey
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k lines not shorter than a and not longer than b, for the text to resemble human speech more. Help Anfisa.

Input

The first line contains three integers ka and b (1 ≤ k ≤ 2001 ≤ a ≤ b ≤ 200). The second line contains a sequence of lowercase Latin letters — the text typed by Anfisa. It is guaranteed that the given line is not empty and its length does not exceed 200 symbols.

Output

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes).

Examples
input
Copy
`3 2 5abrakadabra`
output
Copy
`abrakadabra`
input
Copy
`4 1 2abrakadabra`
output
Copy
`No solution`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <iostream>

int main(){

std::ios_base::sync_with_stdio(false);
long k, a, b; std::cin >> k >> a >> b;
std::string s; std::cin >> s;
if(s.size() < k * a || s.size() > k * b){std::cout << "No solution" << std::endl; return 0;}
long avg = s.size() / k;
long add = s.size() % k;
long cnt(0);
for(long p = 0; p < s.size(); p++){
std::cout << s[p]; ++cnt;
if(cnt >= avg + (add > 0)){std::cout << std::endl; cnt = 0; --add;}
}

return 0;
}``````
Copy The Code &

Input

cmd
3 2 5