#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
int n,m,q,u,v,t,val;
int q1[100000],q2[100000],q3[100000];
int head1=1,tail1,head2=1,tail2,head3=1,tail3;
double p;
bool cmp(int x,int y)
{
	return x>y;
}
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int getmax()
{
	int maxx=0,x=0;
	if(head1<=tail1)
	{
		if(maxx<q1[head1])
		{
			x=1;maxx=q1[head1];
		}
	}
	if(head2<=tail2)
	{
		if(maxx<q2[head2])
		{
			x=2;maxx=q2[head2];
		}
	}
	if(head3<=tail3)
	{
		if(maxx<q3[head3])
		{
			x=3;maxx=q3[head3];
		}
	}
	if(x==1)head1++;
	if(x==2)head2++;
	if(x==3)head3++;
	return maxx;	
}
int main()
{
	freopen("earthworm.in","r",stdin);freopen("earthworm.out","w",stdout);
	n=read();m=read();q=read();u=read();v=read();t=read();
	p=double(u)/double(v);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",q1[++tail1]);
	}
	sort(q1+1,q1+tail1+1,cmp);
	for(int i=1;i<=m;i++)
	{
		int maxx=getmax();
		maxx+=val;
		if(i%t==0)printf("%d ",maxx);
		q2[++tail2]=maxx*p-q-val;
		q3[++tail3]=maxx-maxx*p-q-val;
		val+=q;
	}
	printf("\n");
	for(int i=1;i<=m;i++)
	{
		int maxx=getmax()+val;
		if(1%t==0)printf("%d ",maxx);
	}
	printf("\n");
	
	fclose(stdin);fclose(stdout);
	return 0;
}