#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, m, a, b, i, j, x1, x2, l;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  n = s.size();
  x1 = n / k;
  x2 = (n + k - 1) / k;
  l = n % k;
  if (x2 > b) return cout << "No solution" << endl, 0;
  if (x1 < a) return cout << "No solution" << endl, 0;
  int cnt = 1;
  j = 0;
  while (1) {
    if (cnt == k + 1) break;
    if (cnt <= (k - l)) {
      for (i = j; i < x1 + j; i++) cout << s[i];
      cout << endl;
    } else {
      for (i = j; i < x2 + j; i++) cout << s[i];
      cout << endl;
    }
    j = i;
    cnt++;
  }
}
