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() {
  ifstream myFile("task.in");
  if (!myFile.fail()) {
    assert(freopen("task.in", "r", stdin));
  }
  int k, a, b;
  cin >> k >> a >> b;
  string str;
  cin >> str;
  int n = str.size();
  if (a * k > n) {
    cout << "No solution" << endl;
    return 0;
  }
  if (b * k < n) {
    cout << "No solution" << endl;
    return 0;
  }
  int na = n / k;
  string arr[k + 10];
  for (int i = 0; i < k; i++) {
    arr[i] = "";
  }
  int A[k + 10];
  for (int i = 0; i < k; i++) {
    A[i] = na;
  }
  na = n - na * k;
  int ind = 0, i;
  while (na) {
    A[ind % k]++;
    ind++;
    na--;
  }
  ind = 0;
  i = 0;
  while (i < k) {
    for (int j = ind; j < ind + A[i]; j++) {
      cout << str[j];
    }
    ind += A[i];
    i++;
    cout << endl;
  }
  return 0;
}
