#include <bits/stdc++.h>
const long long INF = 1 << 28;
using namespace std;
long long POWER(long long base, long long expo) {
  long long num = 1;
  long long i = expo;
  while (i) {
    num = num * base;
    i--;
  }
  return num;
}
int main() {
  long long t = 1;
  while (t--) {
    long long k, a, b;
    cin >> k >> a >> b;
    string s;
    cin >> s;
    if (s.length() < k * a || s.length() > k * b)
      cout << "No solution";
    else {
      long long n = s.length();
      vector<long long> v;
      for (long long i = 1; i <= k; i++) {
        v.push_back(n / k);
      }
      n = (n % k);
      long long i = 0;
      while (n > 0) {
        v[i]++;
        n--;
        i++;
      }
      long long j = 0;
      for (long long i = 1; i <= k; i++) {
        cout << s.substr(j, v[i - 1]) << endl;
        j += v[i - 1];
      }
    }
  }
  return 0;
}
