#include <bits/stdc++.h>
using namespace std;
int out[1111];
int main() {
  int n, k, l, r, sall, sk;
  scanf("%d %d %d %d", &n, &k, &l, &r);
  scanf("%d %d", &sall, &sk);
  for (int i = (0); i < (n); ++i) out[i] = l;
  int inisk = sk;
  sk -= k * l;
  int aux = sk / k;
  int resto = sk % k;
  int ind = 0;
  for (int i = (0); i < (k); ++i) out[i] += aux;
  while (resto) {
    if (out[ind] < r) {
      out[ind]++;
      resto--;
    }
    ind = (ind + 1) % k;
  }
  if (n != k) {
    sall -= inisk;
    sall -= (n - k) * l;
    aux = sall / (n - k);
    resto = sall % (n - k);
    ind = k;
    for (int i = (k); i < (n); ++i) out[i] += aux;
    while (resto) {
      if (out[ind] < r) {
        out[ind]++;
        resto--;
      }
      if (ind == n - 1)
        ind = k;
      else
        ind++;
    }
  }
  for (int i = (0); i < (n); ++i) printf("%d ", out[i]);
  printf("\n");
  return 0;
}
