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 k, a and b (1 ≤ k ≤ 200, 1 ≤ 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

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
long long a, b, c[N], d, dp, dis;
char o;
pair<int, int> p;
bool mark, h;
string s;
vector<int> vt;
deque<int> dq;
int main() {
  long long t, k, n, m, f, sum = 0;
  cin >> k >> a >> b >> s;
  n = s.size();
  if (n < (k * a) || n > (k * b))
    cout << "No solution";
  else {
    t = 0;
    for (int i = 0; i < k; i++) {
      f = min(b, n - (k - i - 1) * a);
      n -= f;
      for (int i = 0; i < f; i++) {
        cout << s[t++];
      }
      cout << endl;
    }
  }
}
