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;
template <typename T>
using vector2d = vector<vector<T>>;
template <typename T>
using pair2 = pair<T, T>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
int k, a, b;
string s;
int n;
vector2d<pair2<int>> dp;
bool Solve(int length, int n_lines) {
  if (dp[length][n_lines] == make_pair(-2, -2)) {
    return false;
  }
  if (dp[length][n_lines] != make_pair(-1, -1)) {
    return true;
  }
  if (n_lines == 0) {
    return length == 0;
  }
  if (length <= 0) {
    return false;
  }
  for (int i = a; i <= b; i++) {
    if (Solve(length - i, n_lines - 1)) {
      dp[length][n_lines] = {length - i, n_lines - 1};
      return true;
    }
  }
  dp[length][n_lines] = {-2, -2};
  return false;
}
void Main() {
  cin >> k >> a >> b >> s;
  n = s.length();
  if (k * a > n || k * b < n) {
    cout << "No solution\n";
    return;
  }
  dp.resize(n + 1, vector<pair2<int>>(k + 1, {-1, -1}));
  Solve(n, k);
  vector<int> res;
  int x = n;
  int y = k;
  while (true) {
    res.push_back(x);
    int nx = dp[x][y].first;
    int ny = dp[x][y].second;
    assert(ny == y - 1);
    x = nx;
    y = ny;
    if (x == 0 && y == 0) break;
  }
  reverse(res.begin(), res.end());
  int start = 0;
  for (int end : res) {
    for (int i = start; i < end; i++) {
      cout << s[i];
    }
    cout << '\n';
    start = end;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Main();
  return 0;
}
