#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool prime[1000005];
void seive(int n) {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long k, a, b;
  cin >> k >> a >> b;
  string s;
  cin >> s;
  long long n = s.size();
  vector<string> v(k, "");
  long long last = 0;
  for (long long i = 0; i < k; i++) {
    if (i < (n % k)) {
      v[i] = s.substr(last, (n / k) + 1);
      last = last + (n / k) + 1;
    } else {
      v[i] = s.substr(last, n / k);
      last = last + n / k;
    }
  }
  bool flag = true;
  for (long long i = 0; i < k; i++) {
    if (!(v[i].size() >= a && v[i].size() <= b)) flag = false;
    if (!flag) break;
  }
  if (!flag)
    cout << "No solution" << endl;
  else {
    for (long long i = 0; i < k; i++) {
      cout << v[i] << endl;
    }
  }
  return 0;
}
