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>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int k, a, b;
string s;
int mem[256][256];
int Get(int len, int kk) {
  if (len < 0 || kk < 0) return -2;
  int& res = mem[len][kk];
  if (res == -1) {
    if (len == 0) {
      if (kk == 0)
        res = 0;
      else
        res = -2;
    } else {
      res = -2;
      for (int i = a; i <= b; i++) {
        if (Get(len - i, kk - 1) != -2) {
          res = i;
          break;
        }
      }
    }
  }
  return res;
}
int main() {
  memset(mem, -1, sizeof(mem));
  cin >> k >> a >> b;
  cin >> s;
  int r = Get(s.size(), k);
  if (r == -2)
    printf("No solution\n");
  else {
    int u = s.size();
    vector<string> res;
    for (int kk = k; kk > 0; kk--) {
      res.push_back(s.substr(u - Get(u, kk), Get(u, kk)));
      u -= Get(u, kk);
    }
    for (int i = 0; i < (int)(k); ++i) {
      printf("%s\n", res[k - i - 1].c_str());
    }
  }
  return 0;
}
