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 fx[] = {1, -1, 0, 0};
int fy[] = {0, 0, 1, -1};
int main() {
  int k, a, b;
  cin >> k >> a >> b;
  string str;
  cin >> str;
  int n = str.size();
  int seg = n / k;
  int val = n % k;
  int on = 0;
  if (val) on = 1;
  if (seg < a or seg + on > b)
    cout << "No solution";
  else {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      cout << str[i];
      cnt++;
      if (cnt % seg == 0) {
        if (val) {
          cout << str[i + 1];
          i++;
          val--;
        }
        cout << '\n';
        cnt = 0;
      }
    }
  }
}
