#include <bits/stdc++.h>
using namespace std;
long long int NOD(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return NOD(b, a % b);
}
int LCM(int a, int b) { return a * b / NOD(a, b); }
long long int MOD = 1000000007;
int main() {
  long long int n, k, l, r, sall, sk;
  cin >> n >> k >> l >> r >> sall >> sk;
  vector<long long int> team(n, sall / n);
  long long int ost = sall % n;
  for (int i = 0; i < ost; i++) {
    team[i]++;
  }
  long long int sumk = 0;
  for (int i = 0; i < k; i++) {
    sumk += team[i];
  }
  sk -= sumk;
  for (int i = 0; i < sk; i++) {
    team[(ost + i) % k]++;
  }
  for (int i = 0; i < sk; i++) {
    team[k + i % (n - k)]--;
  }
  for (int i = 0; i < n; i++) cout << team[i] << ' ';
  return 0;
}
