#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * (b / gcd(a, b));
}
void solve() {}
int main() {
  long long int k, a, b;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  long long int n = s.length();
  long long int ech = n / k;
  long long int rem = n % k;
  if (ech < a || ech > b || (rem > 0 && ech + 1 > b))
    cout << "No solution";
  else {
    vector<long long int> v;
    for (long long int i = 0; i < k; i++) {
      long long int x = ech;
      if (rem > 0) {
        x++;
        rem--;
      }
      v.push_back(x);
    }
    long long int m = 0;
    for (long long int j = 0; j < k; j++) {
      for (long long int i = 0; i < v[j]; i++) cout << s[m + i];
      cout << "\n";
      m += v[j];
    }
  }
}
