#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int ans[N];
int main() {
  int n, k, l, r, sall, sk;
  cin >> n >> k >> l >> r >> sall >> sk;
  for (int i = 0; i < k; i++) ans[i] = l;
  int left = sk - k * l, idx = 0;
  while (left) {
    ans[idx]++;
    left--;
    idx = (idx + 1) % k;
  }
  left = sall - sk - (n - k) * l, idx = k;
  for (int i = k; i < n; i++) ans[i] = l;
  while (left) {
    ans[idx]++;
    left--, idx++;
    if (idx == n) idx = k;
  }
  for (int i = 0; i < n; i++) printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
  return 0;
}
