#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, l, r, sall, sk;
  cin >> n >> k >> l >> r >> sall >> sk;
  int* points = new int[n];
  for (int i = 0; i < n; ++i) {
    points[i] = l;
  }
  if (n == k) {
    sk = sk - n * l;
    int i = 0;
    while (sk != 0) {
      int rem = r - points[i];
      if (rem >= sk) {
        points[i] += sk;
        sk = 0;
      } else {
        points[i] = r;
        sk -= rem;
      }
      i++;
    }
  } else {
    int rem = sall - sk - (n - k) * l;
    int add = rem / (n - k);
    int ind = rem % (n - k);
    for (int i = k; i < n; ++i) {
      points[i] += add;
      if (i - k + 1 <= ind) {
        points[i]++;
      }
    }
    int max = points[k];
    for (int i = 0; i < k; ++i) {
      points[i] = max;
    }
    sk = sk - max * k;
    int i = 0;
    while (sk != 0) {
      int rem = r - points[i];
      if (rem >= sk) {
        points[i] += sk;
        sk = 0;
      } else {
        points[i] = r;
        sk -= rem;
      }
      i++;
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << points[i] << " ";
  }
  return 0;
}
