#include <bits/stdc++.h>
int n, k, l, r, s_all, s_k, a[100000], temp = 0, p, pos, i;
int main() {
  scanf("%d %d %d %d %d %d", &n, &k, &l, &r, &s_all, &s_k);
  p = n - k;
  pos = s_all - s_k;
  for (i = 1; i <= p; i++) {
    a[i] = l;
    temp += a[i];
  }
  while (temp < pos) {
    for (i = 1; i <= p; i++) {
      a[i] += 1;
      temp += 1;
      if (temp == pos) break;
    }
  }
  temp = 0;
  for (i = p + 1; i <= n; i++) {
    a[i] = r;
    temp += a[i];
  }
  while (temp > s_k) {
    for (i = p + 1; i <= n; i++) {
      a[i] -= 1;
      temp -= 1;
      if (temp == s_k) break;
    }
  }
  temp = 0;
  for (i = 1; i <= n; i++) printf("%d ", a[i]);
}
