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;
vector<string> v;
string s;
int dp[205][205];
int k, a, b, n;
void ga(int i, int k) {
  if (i > n || k < 0) {
    return;
  }
  if (dp[i][k]) return;
  if (i + b >= n && k == 0) {
    if (n - i < a) return;
    v.push_back(s.substr(i, b));
    for (int k = 0; k < v.size(); k++) {
      cout << v[k] << endl;
    }
    exit(0);
  }
  for (int j = a; j <= b; j++) {
    v.push_back(s.substr(i, j));
    ga(i + j, k - 1);
    v.pop_back();
  }
  dp[i][k] = 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> k >> a >> b;
  cin >> s;
  n = s.length();
  v.clear();
  memset(dp, 0, sizeof(dp));
  ga(0, k - 1);
  printf("No solution\n");
  return 0;
}
