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 power(long long a, long long b) {
  long long c = 1;
  while (b) {
    if (b & 1) c *= a;
    a *= a;
    b /= 2;
  }
  return c;
}
void solve() {
  long long k, a, b;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  long long n = s.size();
  long long i, j;
  if (n < k * a || n > k * b)
    cout << "No solution";
  else {
    long long cur = a;
    vector<long long> v;
    long long rem = n;
    long long count = 0;
    while (rem) {
      if (rem - cur <= (k - count - 1) * b) {
        v.push_back(cur);
        rem -= cur;
        count++;
      } else
        cur++;
    }
    cur = 0;
    for (i = 0; i < v.size(); i++) {
      j = v[i];
      while (j) {
        cout << s[cur];
        cur++;
        j--;
      }
      cout << "\n";
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
