#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define inf 1000000
#define N 200100
#define mod 666013
using namespace std;
//int dx[]={0,2,-2,-2,2};
//int dy[]={0,2,2,-2,-2};
int a[N],i,k,l,n,r,S,s,t;
int main ()
{
    //freopen("a.in","r",stdin);
    f>>n>>k>>l>>r>>S>>s;
    for(i=1;i<=n;++i)
        a[i]=l;
    S-=n*l;
    s-=k*l;
    t=s/k;
    S-=t*k;
    for(i=1;i<=k;++i)
        a[i]+=t;
    s%=k;
    S-=s;
    for(i=1;i<=s;++i)
        a[i]++;
	if(n!=k)
	{
    t=S/(n-k);
    for(i=k+1;i<=n;++i)
        a[i]+=t;
    S%=(n-k);
    for(i=k+1;i<=k+S;++i)
        a[i]++;
	}
    for(i=1;i<=n;++i)
        g<<a[i]<<" ";
    return 0;
}