#include <bits/stdc++.h>
using namespace std;
const int qq = 1005;
int num[qq];
int main() {
  int n, k, l, r, sum, sumk;
  scanf("%d%d", &n, &k);
  scanf("%d%d%d%d", &l, &r, &sum, &sumk);
  int ave = sumk / k;
  int p = sumk % k;
  for (int i = 1; i <= k; ++i) {
    num[i] = ave + (p > 0 ? 1 : 0);
    p--;
  }
  if (n != k) {
    ave = sum - sumk;
    p = ave % (n - k);
    ave = ave / (n - k);
    for (int i = k + 1; i <= n; ++i) {
      num[i] = ave + (p > 0 ? 1 : 0);
      p--;
    }
  }
  for (int i = 1; i < n; ++i) printf("%d ", num[i]);
  printf("%d\n", num[n]);
  return 0;
}
