#include <bits/stdc++.h>
using namespace std;
const int N = 222;
char dp[N][N][N];
int n, k, a, b;
string s;
bool thereIsAnAnser() {
  return ((n / k >= a && n / k < b) ||
          ((n / k >= a && n / k == b) && (n % k == 0)));
}
int main() {
  cin >> k >> a >> b >> s;
  n = s.size();
  if (thereIsAnAnser()) {
    int AnsIdx;
    for (int Test = 0; Test <= b - a; Test++) {
      for (int len = a; len <= b; len++) {
        int Row = k - 1, idx = n, LEN = len;
        while (idx >= 0) {
          for (int dpLtr = 0, strLtr = idx - LEN; strLtr < idx;
               dpLtr++, strLtr++)
            dp[Test][Row][dpLtr] = s[strLtr];
          idx -= LEN;
          Row--;
          if (Row == 0 && (idx - LEN < 0 || idx <= b)) LEN = idx;
          if (Row < 0 && idx > 0)
            break;
          else if (Row < 0 && idx == 0) {
            AnsIdx = Test;
            goto ans;
          }
        }
      }
    }
  ans:
    for (int Row = 0; Row < k; Row++) cout << dp[AnsIdx][Row] << endl;
  } else if (!thereIsAnAnser())
    puts("No solution");
  return 0;
}
