#include <bits/stdc++.h>
using namespace std;
int dp[201][201];
int k, a, b, si;
string x;
int cal(int idx, int rem) {
  if (rem > si) return 0;
  if (idx == k) {
    if (rem != si)
      return 0;
    else {
      return 1;
    }
  }
  int &ret = dp[idx][rem];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = a; i <= b; i++) ret = max(cal(idx + 1, rem + i), ret);
  return ret;
}
void build(int idx, int rem) {
  if (idx == k) return;
  for (int i = a; i <= b; i++) {
    if (idx == k - 1 && rem + i == si) {
      cout << x.substr(rem, i);
      return;
    }
    if (dp[idx][rem] == dp[idx + 1][rem + i]) {
      cout << x.substr(rem, i) << endl;
      build(idx + 1, rem + i);
      return;
    }
  }
}
int main() {
  cin >> k >> a >> b;
  cin >> x;
  memset(dp, -1, sizeof dp);
  si = x.size();
  cal(0, 0);
  if (cal(0, 0) == 0) {
    cout << "No solution";
    return 0;
  }
  build(0, 0);
  return 0;
}
