#include <bits/stdc++.h>
using namespace std;
const int MAX = (int)1e5 + 5;
long long n, k, l, r, sk, sa;
vector<long long> vec;
void solve() {
  cin >> n >> k >> l >> r >> sa >> sk;
  long long res = sk / k, rem = sk % k;
  for (int i = 0; i < k; i++) vec.push_back(res);
  int j = 0;
  while (rem) {
    if (j == k) j = 0;
    vec[j++]++;
    rem--;
  }
  if (n != k) {
    long long p = sa - sk;
    long long res2 = p / (n - k), prem = p % (n - k);
    for (int i = 0; i < (n - k); i++) vec.push_back(res2);
    long long idx = k;
    while (prem) {
      vec[idx++]++;
      prem--;
      if (idx == n) idx = k;
    }
  }
  for (int i = 0; i < n; i++) cout << vec[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
