#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
long long a, b, c[N], d, dp, dis;
char o;
pair<int, int> p;
bool mark, h;
string s;
vector<int> vt;
deque<int> dq;
int main() {
  long long t, k, n, m, f, sum = 0;
  cin >> k >> a >> b >> s;
  n = s.size();
  if (n < (k * a) || n > (k * b))
    cout << "No solution";
  else {
    t = 0;
    for (int i = 0; i < k; i++) {
      f = min(b, n - (k - i - 1) * a);
      n -= f;
      for (int i = 0; i < f; i++) {
        cout << s[t++];
      }
      cout << endl;
    }
  }
}
