#include <bits/stdc++.h>
using namespace std;
const int N = 120010;
int a[N];
map<int, int> cnt;
int main() {
  int k, a, b;
  string s;
  cin >> k >> a >> b >> s;
  int n = s.size();
  if (n < k * a || k * b < n) return cout << "No solution", 0;
  int rem = n % k, ptr = 0;
  for (int i = 0; i < k; i++) {
    int x = n / k + (rem > 0);
    rem--;
    for (int j = ptr; j < ptr + x; j++) cout << s[j];
    cout << '\n';
    ptr += x;
  }
  return 0;
}
