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 mod = 1e9 + 7;
const int maxn = 1000005;
void go() {
  int n, a, b;
  cin >> n >> a >> b;
  string s;
  cin >> s;
  if (a * n <= s.size() && b * n >= s.size()) {
    int sz = s.size();
    int md = sz % n;
    int div = sz / n;
    int ptr = 0;
    for (int i = 0; i < md; i++) {
      cout << s.substr(ptr, div + 1) << '\n';
      ;
      ptr += div + 1;
    }
    for (int i = 0; i < n - md; i++) {
      cout << s.substr(ptr, div) << '\n';
      ;
      ptr += div;
    }
  } else {
    cout << "No solution\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int c = 0;
  int t;
  if (!c) {
    t = 1;
  } else {
    cin >> t;
  }
  while (t--) {
    go();
  }
}
