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;
void prepare() {}
string s;
int dp[205][205];
int from[205][205];
int a, b, K;
void solve() {
  memset((dp), (0), sizeof(dp));
  memset((from), (-1), sizeof(from));
  cin >> K >> a >> b;
  cin >> s;
  dp[0][0] = 1;
  for (int k = 1; k <= K; k++) {
    for (int i = 0; i < (int)(s).size(); i++) {
      for (int j = a; j <= b; j++) {
        int x = i - j + 1;
        if (x >= 0) {
          if (dp[k - 1][x]) {
            dp[k][i + 1] = 1;
            from[k][i + 1] = x;
            break;
          }
        }
      }
    }
  }
  if (!dp[K][(int)(s).size()])
    printf("No solution\n");
  else {
    vector<string> v;
    for (int i = (int)(s).size(), j = K; i > 0; i = from[j][i], j--) {
      v.push_back(s.substr(from[j][i], i - from[j][i]));
    }
    reverse(v.begin(), v.end());
    for (int i = 0; i < (int)(v).size(); i++) cout << v[i] << endl;
  }
}
int main() {
  prepare();
  solve();
  return 0;
}
