#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
int n,m,q,u,v,t,a;
int s[300001];
int main()
{
priority_queue <int> que;
freopen("earthworm.in","r",stdin);
freopen("earthworm.out","w",stdout);
scanf("%d%d%d%d%d%d",&n,&m,&q,&u,&v,&t);
if (m==0)
{
for (int i=1;i<=n;i++)
scanf("%d",&s[i]);
sort(s+1,s+n+1);
printf("\n");
for (int i=n;i>=1;i--)
printf("%d ",s[i]);
}
else
{
for (int i=1;i<=n;i++)
{
scanf("%d",&a);
que.push(q*m+a);
}
for (int i=1;i<=m;i++)
{
int b=que.top();
int da=b-(m-i+1)*q;
if (i%t==0)
printf("%d ",da);
que.pop();
que.push(b-int(da*u/v)-q);
que.push(b-(da-int(da*u/v))-q);
}
printf("\n");
for (int i=1;i<=n+m;i++)
{
if (i%t==0)
printf("%d ",que.top());
que.pop();
}
}
return 0;
}