#include <bits/stdc++.h>
using namespace std;
int n, k, l, r, sall, sk, sleft;
void init() {
  cin >> n >> k >> l >> r >> sall >> sk;
  sleft = sall - sk;
}
void solve() {
  vector<int> v(n);
  if (k < n) {
    int leastPoints = sleft / (n - k);
    for (int i = k; i <= n - 1; i++) {
      v[i] = leastPoints;
      sleft -= leastPoints;
    }
    for (int i = k; i <= n - 1; i++) {
      if (!sleft) break;
      v[i]++;
      sleft--;
    }
  }
  int leastPoints = sk / k;
  for (int i = 0; i <= k - 1; i++) v[i] = leastPoints, sk -= leastPoints;
  for (int i = 0; i <= (sk % k) - 1; i++) v[i]++;
  for (int i = 0; i <= n - 1; i++) cout << v[i] << " ";
  cout << endl;
}
int main() {
  int numberOfTests = 1;
  for (int i = 1; i <= numberOfTests; i++) {
    init();
    solve();
  }
  return 0;
}
