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;
int main() {
  std::ios::sync_with_stdio(false);
  int T = 1;
  while (T--) {
    int k, a, b;
    cin >> k >> a >> b;
    string second;
    cin >> second;
    if (second.length() >= a * k && second.length() <= b * k) {
      int i = 0;
      int flag = 0;
      for (i = a; i <= b; i++) {
        int p = second.length() - (k - 1) * i;
        if (p >= a && p <= b) {
          flag = 1;
          break;
        }
      }
      if (flag) {
        for (int j = 0; j < (k - 1) * i; j++) {
          cout << second[j];
          if (j % i == i - 1) cout << "\n";
        }
        for (int j = (k - 1) * i; j < second.length(); j++) {
          cout << second[j];
        }
      } else
        cout << "No solution";
    } else
      cout << "No solution";
  }
  return 0;
}
