#include <bits/stdc++.h>
using namespace std;
int n, k, l, r, sum, sumk, cnt, res1, res2;
void solve(int p, int n) {
  int i, j, p1, p2, p3, p4, p5, flag = 0;
  cnt++;
  p1 = p / n;
  if (p % n) {
    for (i = 1; !flag; i++) {
      p3 = p1 * (n - i);
      p2 = p - p3;
      if (p2 % i == 0) {
        p4 = p2 / i;
        if (p4 <= r && p4 >= l) {
          if (cnt == 1) {
            p5 = p4;
            flag = 1;
            res1 = p5;
            res2 = p1;
            break;
          } else if (cnt == 2) {
            if (p4 <= res1 && p4 <= res2) {
              p5 = p4;
              flag = 1;
              break;
            }
          }
        }
      }
    }
    for (j = 0; j < n - i; j++) printf("%d ", p1);
    for (j = 0; j < i; j++) {
      if (flag)
        printf("%d ", p5);
      else
        printf("%d ", p1);
    }
  } else {
    if (cnt == 1) res1 = res2 = p1;
    for (i = 1; i <= n; i++) printf("%d ", p1);
  }
}
int main() {
  int t1, t2;
  while (scanf("%d%d%d%d%d%d", &n, &k, &l, &r, &sum, &sumk) != EOF) {
    cnt = 0;
    solve(sumk, k);
    if (sum != sumk) {
      t1 = sum - sumk;
      t2 = n - k;
      solve(t1, t2);
    }
    printf("\n");
  }
  return 0;
}
