#include <bits/stdc++.h>
using namespace std;
string s;
int k, a, b, n, f[222][222], v[222];
int main() {
  scanf("%d%d%d\n", &k, &a, &b);
  cin >> s;
  n = s.length();
  f[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= k; j++) {
      bool alive = false;
      for (int t = a; t <= b; t++) {
        if (i < t) continue;
        f[i][j] |= f[i - t][j - 1];
      }
    }
  if (!f[n][k]) {
    cout << "No solution" << endl;
    return 0;
  }
  int i = n, j = k;
  v[n] = 1;
  while (1) {
    for (int t = a; t <= b; t++)
      if (f[i - t][j - 1]) {
        i -= t;
        v[i] = 1;
        j--;
        break;
      }
    if (j == 0) break;
  }
  for (int i = 1; i <= n; i++) {
    cout << s[i - 1];
    if (v[i]) cout << endl;
  }
  return 0;
}
