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 long long M = 2e5 + 2, MOD = 1e9 + 7;
string s;
int arr[M], a[M];
vector<int> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int k, a, b, c;
  cin >> k >> a >> b;
  cin >> s;
  int len = s.size();
  int res = len / k;
  int mx = res;
  if (res == 0) {
    return cout << "No solution" << endl, 0;
  }
  if (len % k) mx++;
  if (mx <= b && mx >= a && res >= a && res <= b) {
    int i = 0;
    c = len % k;
    while (i < k) v.push_back(res), i++;
    i = 0;
    while (c--) {
      v[i]++;
      i++;
    }
    i = 0;
    for (auto x : v) {
      int d = x;
      while (d--) {
        cout << s[i];
        i++;
      }
      cout << endl;
    }
  } else {
    cout << "No solution" << endl;
  }
  return 0;
}
