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;
const int Maxn = 100100;
const int INF = 0x7f7f7f7f;
const double eps = 1e-8;
const double pi = 3.1415926535897932384626433832795;
int ans[210];
int main() {
  int k, a, b, len;
  string str;
  cin >> k >> a >> b;
  cin >> str;
  len = (int)str.size();
  if (k * a > len || k * b < len)
    cout << "No solution\n";
  else {
    int t = len - a * k;
    for (int i = 0; i < k; i++) ans[i] = a;
    for (int i = 0; i < k; i++)
      if (t > 0) {
        ans[i] += min(t, b - a);
        t -= min(t, b - a);
      }
    t = 0;
    for (int i = 0; i < k; i++) {
      cout << str.substr(t, ans[i]) << endl;
      t += ans[i];
    }
  }
  return 0;
}
