#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k, l, r, sum_all, sum_k;
  cin >> n >> k >> l >> r >> sum_all >> sum_k;
  long long ar[n];
  for (auto &x : ar) x = l;
  if (n == k) {
    long long fill_ar = sum_all - l * n;
    for (int i = 0; i < n; i++) ar[i] += fill_ar / n;
    for (int i = 0; i < fill_ar % n; i++) ar[i]++;
  } else {
    long long sum_others = sum_all - sum_k;
    long long fill_others = sum_others - l * (n - k);
    for (long long i = k; i < n; i++) ar[i] += fill_others / (n - k);
    long long left_others = fill_others % (n - k);
    for (long long i = k; i < k + left_others; i++) ar[i]++;
    for (long long i = 0; i < k; i++) ar[i] = ar[k];
    long long fill_k = sum_k - ar[0] * k;
    for (long long i = 0; i < k; i++) ar[i] += fill_k / k;
    for (long long i = 0; i < fill_k % k; i++) ar[i]++;
  }
  for (long long i = 0; i < n; i++) cout << ar[i] << " \n"[i == n - 1];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long T = 1;
  while (T--) solve();
  return 0;
}
