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 check(int k, int a, int b, int remain) {
  if (remain == 0) {
    return 4;
  }
  if (remain < k * a || remain > k * b) {
    return 0;
  }
  if (remain == k * a) {
    return 1;
  }
  if (remain == k * b) {
    return 2;
  }
  return 3;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int k, a, b;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  if (s.length() < k * a || s.length() > k * b) {
    cout << "No solution" << endl;
    return 0;
  }
  vector<int> v;
  int len = s.length();
  while (k > 0) {
    for (int i = a; i <= b; i++) {
      if (len - i < (k - 1) * a || len - i > (k - 1) * b) {
        continue;
      }
      v.push_back(i);
      k--;
      if (len - i == k * a) {
        for (; k > 0; k--) {
          v.push_back(a);
        }
      } else if (len - i == k * b) {
        for (; k > 0; k--) {
          v.push_back(b);
        }
      } else {
        len -= i;
      }
    }
  }
  int index = 0;
  for (int l : v) {
    cout << s.substr(index, l) << endl;
    index += l;
  }
}
