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 n, a, b;
string s;
bool dp[205][205];
int pred[205][205];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> a >> b;
  cin >> s;
  int m = s.size();
  dp[0][0] = true;
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= n; ++j)
      for (int k = a; k <= min(i, b); ++k) {
        if (dp[i - k][j - 1]) {
          dp[i][j] = true;
          pred[i][j] = k;
          break;
        }
      }
  }
  if (!dp[m][n]) {
    cout << "No solution";
    return 0;
  }
  vector<string> q;
  while (m) {
    string ss = "";
    for (int j = m - pred[m][n] + 1; j <= m; ++j) ss += s[j - 1];
    q.push_back(ss);
    m -= pred[m][n];
    --n;
  }
  for (int i = q.size() - 1; i >= 0; --i) cout << q[i] << '\n';
}
