#include <bits/stdc++.h>
using std::max;
using std::min;
using std::string;
using std::vector;
using namespace std;
void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  long long ans = 0;
  string x = s;
  long long ans1 = 0;
  int j = n - 1;
  for (int i = 0; i < n; i++) {
    if (s[i] == '1' && i % 2 == 0 &&
        (i < n - 1 && s[i + 1] == '0' || i > 0 && s[i - 1] == '0')) {
      ans1++;
      s[i] = '0';
    } else if (s[i] == '1' && i % 2 == 0) {
      ans1 += 2;
      s[i] = '0';
    }
  }
  s = x;
  long long ans2 = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '1' && i % 2 &&
        (i < n - 1 && s[i + 1] == '0' || i > 0 && s[i - 1] == '0')) {
      ans2++;
      s[i] = '0';
    } else if (s[i] == '1' && i % 2) {
      ans2 += 2;
      s[i] = '0';
    }
  }
  cout << min(ans1, ans2) << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k, l, r, sall, sk;
  cin >> n >> k >> l >> r >> sall >> sk;
  sall -= sk;
  vector<int> v;
  for (int i = 0; i < k; i++) {
    v.push_back(sk / k);
  }
  sk %= k;
  for (int i = 0; i < sk; i++) {
    v[i]++;
  }
  for (int i = 0; i < n - k; i++) {
    v.push_back(sall / (n - k));
  }
  if (n != k) {
    sall %= (n - k);
  } else {
    sall = 0;
  }
  for (int i = n - 1; i >= 0; i--) {
    if (sall <= 0) break;
    sall--;
    v[i]++;
  }
  for (int i = 0; i < n; i++) cout << v[i] << " ";
}
