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>
const long long int mod = (long long int)1e9 + 7;
const long long int inf = (long long)1e13;
const long long int MAX = 1e5 + 1;
using namespace std;
signed main() {
  long long int k, a, b;
  cin >> k >> a >> b;
  string str;
  cin >> str;
  long long int n = str.length();
  if (n < k * a || n > b * k) {
    cout << "No solution";
  } else {
    long long int len = n / k;
    vector<string> v;
    for (long long int i = 0; i < n; i += len) {
      v.push_back(str.substr(i, len));
    }
    if (v.size() == k) {
      for (long long int i = 0; i < v.size(); i++) cout << v[i] << "\n";
    } else {
      long long int sz = v.size();
      for (long long int i = 0; i < v.size() - 2; i++) cout << v[i] << "\n";
      cout << v[sz - 2] << "" << v[sz - 1];
    }
  }
}
