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 read_num() {
  int num = 0;
  char ch;
  ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  do {
    num = num * 10 + (ch - '0');
    ch = getchar();
  } while (isdigit(ch));
  return num;
}
int sahi[101];
int main() {
  int n;
  int k, a, b;
  string s;
  cin >> k >> a >> b;
  cin >> s;
  n = s.size();
  bool boo = true;
  if (n < a * k || n > k * b) boo = false;
  string temp = s;
  if (!boo) {
    cout << "No solution" << endl;
    return 0;
  }
  if (n % k == 0) {
    int in = 0;
    for (int i = 0; i < k; i++) {
      cout << s.substr(in, n / k) << endl;
      in += n / k;
    }
  } else {
    int rem = n % k;
    int in = 0;
    for (int i = 0; i < rem; i++) {
      cout << s.substr(in, n / k + 1) << endl;
      in += n / k + 1;
    }
    for (int i = 0; i < k - rem; i++) {
      cout << s.substr(in, n / k) << endl;
      in += n / k;
    }
  }
  return 0;
}
