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>
int main() {
  int n, a, b, i, j, g, h, w, k, m;
  double f;
  scanf("%d %d %d", &n, &a, &b);
  char str[201];
  scanf("%s", str);
  w = strlen(str);
  if (n > w) {
    printf("No solution");
  } else if ((n * a) > w || (n * b) < w) {
    printf("No solution");
  } else {
    f = (double)w / n;
    g = floor(f);
    h = ceil(f);
    if (w - g * (n - 1) > b) {
      k = 0;
      for (i = 0; i < w; i += h) {
        for (j = i; j < i + h; j++) {
          printf("%c", str[j]);
        }
        printf("\n");
        if (k == n - 1) {
          break;
        }
      }
      for (m = j; m < w; m++) {
        printf("%c", str[m]);
      }
    } else {
      k = 0;
      for (i = 0; i < w; i += g) {
        for (j = i; j < i + g; j++) {
          printf("%c", str[j]);
        }
        printf("\n");
        k = k + 1;
        if (k == n - 1) {
          break;
        }
      }
      for (m = j; m < w; m++) {
        printf("%c", str[m]);
      }
    }
  }
  return 0;
}
