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 k, a, b;
string str;
int main() {
  cin >> k >> a >> b >> str;
  int n = str.length(), len[2], tot[2];
  len[0] = a + (n - k * a) / k;
  len[1] = len[0] + 1, tot[1] = (n - k * a) % k;
  tot[0] = k - tot[1];
  if (n > k * b || n < k * a) {
    cout << "No solution\n";
    return 0;
  }
  int cnt = 0;
  for (int l = 0; l < 2; l++)
    for (int i = 0; i < tot[l]; i++) {
      for (int j = 0; j < len[l]; j++) cout << str[cnt++];
      puts("");
    }
  return 0;
}
