#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, n, k, l, r, sall, sk, a[1001];
  cin >> n >> k >> l >> r >> sall >> sk;
  int d = sall / n;
  for (i = 0; i < n; i++) a[i] = d;
  int m = sall % n;
  for (i = 0; i < m; i++) a[i]++;
  int s = 0;
  for (i = 0; i < k; i++) s = s + a[i];
  d = abs(s - sk);
  if (d == 0) {
    for (j = 0; j < n; j++) cout << a[j] << " ";
    return 0;
  }
  if (sk > s) {
    int p = n - 1;
    while (a[p] == l && p > 0) p--;
    for (i = 0; i < n / 2 + n % 2; i++) {
      while (d > 0 && a[i] < r && a[p] > l) {
        a[i]++;
        a[p]--;
        if (a[p] == l) p--;
        d--;
      }
      if (d == 0) {
        for (j = 0; j < n; j++) cout << a[j] << " ";
        return 0;
      }
    }
  }
  return 0;
}
