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;
int main() {
  int W, a, b, N;
  string S;
  int res[300];
  int i, j, sob;
  cin >> W >> a >> b >> S;
  N = S.size();
  if (W * a > N) {
    cout << "No solution" << endl;
    return 0;
  }
  for (i = 0; i + 1 < W; i++) {
    res[i] = a;
    N -= a;
  }
  res[i] = N;
  for (i = W - 1; i > 0; i--) {
    if (res[i] <= b) {
      break;
    }
    sob = res[i] - b;
    for (j = 0; j < i; j++) {
      res[j] += sob / i;
    }
    sob %= i;
    for (j = i - 1; sob; j--, sob--) res[j]++;
    res[i] = b;
  }
  if (res[0] > b) {
    cout << "No solution" << endl;
    return 0;
  }
  for (i = 0; i < W; i++) {
    cout << S.substr(0, res[i]) << endl;
    S = S.substr(res[i], S.size() - res[i]);
  }
  return 0;
}
