#include <bits/stdc++.h>
using namespace std;
int n, k, l, r, sa, sk;
int main() {
  cin >> n >> k >> l >> r >> sa >> sk;
  for (int p = l; p <= r; p++) {
    int maxk = sk - p * k;
    int maxnk = sa + l * k - sk - l * n;
    int curk = 0;
    int curnk = 0;
    int arr[n + 1];
    for (int i = 1; i <= n; i++) {
      if (i <= n - k) {
        arr[i] = l;
      } else {
        arr[i] = p;
      }
    }
    for (int i = n - k; i >= 1; i--) {
      arr[i] = min(p, maxnk - curnk + l);
      curnk = curnk + arr[i] - l;
    }
    for (int i = n; i >= n - k + 1; i--) {
      arr[i] = min(r, maxk - curk + p);
      curk = curk + arr[i] - p;
    }
    if ((curnk == maxnk) && (curk == maxk)) {
      for (int i = 1; i <= n; i++) {
        cout << arr[i];
        if (i == n) {
          cout << endl;
        } else {
          cout << " ";
        }
      }
      return 0;
    }
  }
  return 0;
}
