#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> mp, mk;
set<long long int> s1, s2;
vector<long long int> v, w;
long long int a[2000006], b[2000006];
string s = "", p = "", q = "";
char ch;
long long int m, n, c, i, j, k, l, r, x, t, y, u, e, f, g, h, mn, mx, d, z;
int main() {
  cin >> n >> c >> d >> s;
  m = s.size();
  if (n * c > m || n * d < m)
    cout << "No solution";
  else {
    while (n--) {
      while (d > s.size() - n * c) d--;
      cout << s.substr(0, d) << endl;
      ;
      s.erase(0, d);
    }
  }
}
