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;
int L;
char word[205];
bool findit(int pos, int left) {
  if (left == 0) return 1;
  for (int i = a; i <= b; i++) {
    if ((left - 1) * a <= L - pos - i && L - pos - i <= (left - 1) * b) {
      for (int j = pos; j <= pos + i - 1; j++) printf("%c", word[j]);
      printf("\n");
      findit(pos + i, left - 1);
      return 1;
    }
  }
  return 0;
}
int main() {
  scanf("%d%d%d", &k, &a, &b);
  scanf("%s", &word);
  L = strlen(word);
  bool answer = findit(0, k);
  if (!answer) printf("No solution\n");
}
