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 QPow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans *= a;
    a = a * a;
    b >>= 1;
  }
  return ans;
}
const int maxn = 1e5 + 2;
string str;
signed main() {
  ifstream in("Text.txt");
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  int n;
  int k, a, b;
  cin >> k >> a >> b;
  cin >> str;
  int sz = str.size();
  if (sz / k + ((sz % k) > 0) > b || sz / k + ((sz % k) > 0) < a ||
      sz / k < a || sz / k > b)
    cout << "No solution\n";
  else {
    int j = 0;
    int m;
    for (int i = 0; i < k; i++) {
      for (m = j; m < (j + (sz / k) + (i >= k - (sz % k))); m++) cout << str[m];
      cout << endl;
      j = m;
    }
  }
  return 0;
}
