#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
const long long mod = 1e9 + 7;
const long long INF = 30;
const long long inf = -1e18;
long long n, k, l, r, s, sk, a[N];
int main() {
  cin >> n >> k >> l >> r >> s >> sk;
  int q = s - sk;
  for (int i = 1; i <= k; i++) {
    a[i] = sk / k;
    if (sk % k != 0) {
      a[i]++;
      sk--;
    }
  }
  if (k < n) {
    int w = n - k;
    for (int i = k + 1; i <= n; i++) {
      a[i] = q / w;
      if (q % w != 0) {
        a[i]++;
        q--;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
