#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y, z;
};
int n, m;
int b, c;
string s;
int main() {
  cin >> n >> b >> c >> s;
  m = s.size();
  if (n * b <= m && m <= n * c) {
    int k = m / n, i = 0;
    for (int j = 0; j < n; j++) {
      int l = (j >= n - m % n) ? 1 : 0;
      cout << s.substr(i, k + l) << endl;
      i += k + l;
    }
  } else {
    cout << "No solution";
  }
  return 0;
}
