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 dp[300];
bool f(int k, int a, int b, int size, int cur, int index) {
  if (index == k + 1) {
    if (cur == size)
      return true;
    else
      return false;
  }
  if (dp[index] == b) {
    if (f(k, a, b, size, cur + b, index + 1))
      return true;
    else
      return false;
  }
  for (int i = a; i <= b; ++i) {
    dp[index] = i;
    if (f(k, a, b, size, cur + i, index + 1)) {
      return true;
    }
  }
  return false;
}
int main() {
  for (int i = 0; i < 300; ++i) dp[i] = 0;
  int k, a, b, size = 0;
  cin >> k >> a >> b;
  string cad;
  cin >> cad;
  size = cad.size();
  if (f(k, a, b, size, 0, 1)) {
    int end = 0;
    for (int i = 1; i <= k; ++i) {
      for (int j = 0; j < dp[i]; ++j) {
        cout << cad[j + end];
      }
      cout << '\n';
      end += dp[i];
    }
  } else {
    cout << "No solution" << '\n';
  }
  return 0;
}
