#include <bits/stdc++.h>
using namespace std;
template <class T>
T CMP_MIN(T a, T b) {
  return a < b;
}
template <class T>
T CMP_MAX(T a, T b) {
  return a > b;
}
template <class T>
T MAX(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T MIN(T a, T b) {
  return a < b ? a : b;
}
template <class T>
T GCD(T a, T b) {
  return b ? GCD(b, a % b) : a;
}
template <class T>
T LCM(T a, T b) {
  return a / GCD(a, b) * b;
}
const int MAXN = 110000;
const int MAXM = 1000006;
const double eps = 1e-10;
const long long MOD = 1000000007;
int n, k, l, r, sa, sk;
int main() {
  while (~scanf("%d %d %d %d %d %d", &n, &k, &l, &r, &sa, &sk)) {
    int p = sk % k, v = sk / k;
    printf("%d", v + (p ? 1 : 0));
    for (int i = 1; i < k; i++) {
      printf(" %d", v + (i < p ? 1 : 0));
    }
    if (k < n) {
      p = (sa - sk) % (n - k);
      v = (sa - sk) / (n - k);
      for (int i = 0; i < n - k; i++) {
        printf(" %d", v + (i < p ? 1 : 0));
      }
    }
    printf("\n");
  }
  return 0;
}
