#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, p[222][222];
string s, r[222];
bool f[222][222];
int main() {
  cin >> m >> a >> b;
  cin >> s;
  n = s.size();
  f[0][0] = true;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      for (int k = a; k <= b; k++)
        if (j >= k && f[i - 1][j - k]) {
          f[i][j] = true;
          p[i][j] = k;
          break;
        }
  if (!f[m][n]) {
    cout << "No solution";
    return 0;
  }
  int i = n;
  for (int j = m - 1; j >= 0; j--) {
    int k = p[j + 1][i];
    r[j] = s.substr(i - k, k);
    i -= k;
  }
  for (int i = 0; i < m; i++) cout << r[i] << endl;
  return 0;
}
