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;
const int maxn = 200 + 10;
string s;
int k, a, b, n;
int x[maxn];
int main() {
  cin >> k >> a >> b;
  cin >> s;
  n = s.size();
  if (k * b < n || k * a > n) {
    cout << "No solution" << endl;
    return 0;
  }
  int cnt = k * b;
  for (int i = 1; i <= k; i++) x[i] = b;
  for (int i = 1; i <= k; i++) {
    if (cnt - n >= b - a) {
      x[i] = a;
      cnt -= b - a;
    } else {
      x[i] = x[i] - (cnt - n);
      break;
    }
  }
  int ind = 0;
  for (int i = 1; i <= k; i++) {
    int ind1 = ind;
    int ind2 = ind + x[i] - 1;
    ind = ind2 + 1;
    for (int j = ind1; j <= ind2; j++) cout << s[j];
    cout << endl;
  }
  return 0;
}
