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;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * (b / gcd(a, b));
}
void solve() {}
int main() {
  long long int k, a, b;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  long long int n = s.length();
  long long int ech = n / k;
  long long int rem = n % k;
  if (ech < a || ech > b || (rem > 0 && ech + 1 > b))
    cout << "No solution";
  else {
    vector<long long int> v;
    for (long long int i = 0; i < k; i++) {
      long long int x = ech;
      if (rem > 0) {
        x++;
        rem--;
      }
      v.push_back(x);
    }
    long long int m = 0;
    for (long long int j = 0; j < k; j++) {
      for (long long int i = 0; i < v[j]; i++) cout << s[m + i];
      cout << "\n";
      m += v[j];
    }
  }
}
