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 n, m, i, j, k, a, b, c, dp[205][205], l, id, id2;
char d[205];
int main() {
  scanf("%d %d %d", &k, &a, &b);
  scanf("%s", d + 1);
  n = strlen(d + 1);
  dp[n + 1][0] = 1;
  for (i = n; i; i--) {
    for (j = 1; j <= k; j++) {
      for (l = a; l <= b; l++) {
        if (i + l > n + 1) break;
        if (dp[i + l][j - 1]) {
          dp[i][j] = l;
          break;
        }
      }
    }
  }
  if (!dp[1][k]) {
    printf("No solution\n");
    return 0;
  }
  id = 1, id2 = k;
  while (id <= n) {
    l = dp[id][id2];
    for (i = id; i < id + l; i++) printf("%c", d[i]);
    puts("");
    id += l;
    id2--;
  }
  return 0;
}
