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;
char s[10000];
int main() {
  int k, a, b;
  while (cin >> k >> a >> b) {
    char ch;
    int i = 0;
    while ((ch = getchar()) != EOF) s[i++] = ch;
    int len = strlen(s);
    if ((len - 2) < k * a || (len - 2) > k * b)
      cout << "No solution" << endl;
    else {
      int ave = (len - 2) / k, j, l;
      for (j = 1; j <= k; j++) {
        if (j < k) {
          for (l = (j - 1) * ave + 1; l <= j * ave; l++) cout << s[l];
          cout << endl;
        } else {
          for (l = (j - 1) * ave + 1; l < len - 1; l++) cout << s[l];
          cout << endl;
        }
      }
    }
  }
  return 0;
}
