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 INF = 1 << 28;
using namespace std;
long long POWER(long long base, long long expo) {
  long long num = 1;
  long long i = expo;
  while (i) {
    num = num * base;
    i--;
  }
  return num;
}
int main() {
  long long t = 1;
  while (t--) {
    long long k, a, b;
    cin >> k >> a >> b;
    string s;
    cin >> s;
    if (s.length() < k * a || s.length() > k * b)
      cout << "No solution";
    else {
      long long n = s.length();
      vector<long long> v;
      for (long long i = 1; i <= k; i++) {
        v.push_back(n / k);
      }
      n = (n % k);
      long long i = 0;
      while (n > 0) {
        v[i]++;
        n--;
        i++;
      }
      long long j = 0;
      for (long long i = 1; i <= k; i++) {
        cout << s.substr(j, v[i - 1]) << endl;
        j += v[i - 1];
      }
    }
  }
  return 0;
}
