#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265;
const int mod = 1e9 + 7;
const int N = 2e5;
void solve() {
  int k, a, b;
  scanf("%d%d%d", &k, &a, &b);
  string s;
  cin >> s;
  int n = s.size();
  if (k * a > n || k * b < n) {
    puts("No solution");
    return;
  }
  vector<int> v(k, a);
  int sum = k * a;
  int i = 0;
  while (sum < n) {
    for (int i = 0; i < k; i++) {
      v[i]++;
      sum++;
      if (sum == n) break;
    }
  }
  reverse(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (v.back() == 0) {
      v.pop_back();
      cout << endl;
    }
    cout << s[i];
    if (v.size()) v.back()--;
  }
}
int main() {
  solve();
  return 0;
}
