#include <bits/stdc++.h>
using namespace std;
long long int modExp(long long int base, long long int power) {
  if (power == 0) {
    return 1;
  } else {
    long long int cur = modExp(base, power / 2);
    cur = cur * cur;
    cur = cur % 1000000007;
    if (power % 2 == 1) cur = cur * base;
    cur = cur % 1000000007;
    return cur;
  }
}
void solve() {
  long long int n, k, l, r, sall, sk;
  cin >> n >> k >> l >> r >> sall >> sk;
  vector<long long int> ans;
  long long int temp = sk / k;
  long long int num = sk - temp * k;
  for (long long int i = 0; i < num; i++) {
    ans.push_back(temp + 1);
  }
  for (long long int i = 0; i < k - num; i++) {
    ans.push_back(temp);
  }
  if (n - k != 0) {
    temp = (sall - sk) / (n - k);
    num = (sall - sk) - (temp * (n - k));
    for (long long int i = 0; i < num; i++) {
      ans.push_back(temp + 1);
    }
    for (long long int i = 0; i < n - k - num; i++) {
      ans.push_back(temp);
    }
  }
  sort(ans.begin(), ans.end());
  for (long long int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
