#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, l, r, sall, sk;
  vector<int> dist;
  cin >> n >> k >> l >> r >> sall >> sk;
  dist.assign(n, l);
  sall -= n * l;
  sk -= k * l;
  int i = 0;
  while (sk > 0) {
    dist[i]++;
    sk--, sall--;
    i = (i + 1) % k;
  }
  i = k;
  while (sall > 0) {
    dist[i]++;
    sall--;
    i++;
    if (i >= n) i = k;
  }
  for (int j = 0; j < n; j++) {
    cout << dist[j] << " ";
  }
  cout << endl;
  return 0;
}
