#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
string s;
int a, b;
vector<int> res;
bool solve(int i, int k);
int dp[205][205];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  memset(dp, -1, sizeof(dp));
  int k;
  cin >> k >> a >> b >> s;
  if (!solve(0, k)) {
    cout << "No solution\n";
  } else {
    int cur = 0;
    reverse(res.begin(), res.end());
    for (int i = 0; i < res.size();) {
      while (cur <= res[i]) {
        cout << s[cur];
        cur++;
      }
      i++;
      cout << '\n';
    }
  }
  return 0;
}
bool solve(int i, int k) {
  if (i == s.length()) {
    return dp[i][k] = (k == 0);
  }
  if (k == 0) {
    return dp[i][k] = false;
  }
  if (i > s.length() - a) {
    return dp[i][k] = false;
  }
  if (dp[i][k] != -1) {
    return dp[i][k];
  }
  bool flag = false;
  for (int x = i + a - 1; x <= min((int)s.length() - 1, i + b - 1); x++) {
    if (solve(x + 1, k - 1)) {
      res.push_back(x);
      flag = true;
      break;
    }
  }
  return dp[i][k] = flag;
}
