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>
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
using namespace std;
int main() {
  char s[100005];
  int k, a, b;
  scanf("%d%d%d", &k, &a, &b);
  scanf("%s", s);
  int len = strlen(s);
  if (len < k * a || len > k * b)
    printf("No solution\n");
  else {
    int ans[201];
    for (int i = 0; i < k; i++) ans[i] = len / k;
    for (int i = 0; i < len % k; i++) ans[i]++;
    char *b = s;
    for (int i = 0; i < k; i++) {
      for (int j = 0; j < ans[i]; j++) {
        printf("%c", *b);
        b++;
      }
      printf("\n");
    }
  }
  return 0;
}
