#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, l, r, sall, sk, rest, sob1, sob2, each1, each2;
  int max1, max2, countdumbs1, countdumbs2;
  cin >> n >> k >> l >> r >> sall >> sk;
  rest = sall - sk;
  sob1 = sk % k;
  if (k != n)
    sob2 = rest % (n - k);
  else
    sob2 = 0;
  each1 = (sk - sob1) / k;
  if (k != n)
    each2 = (rest - sob2) / (n - k);
  else
    each2 = 0;
  max1 = each1 + 1;
  max2 = each2 + 1;
  countdumbs1 = k - sob1;
  countdumbs2 = (n - k) - sob2;
  for (int i = 0; i < sob1; i++) printf("%d ", max1);
  for (int i = 0; i < countdumbs1; i++) printf("%d ", each1);
  for (int i = 0; i < sob2; i++) printf("%d ", max2);
  for (int i = 0; i < countdumbs2; i++) printf("%d ", each2);
  return 0;
}
