#include<bits/stdc++.h>
using namespace std;
queue<int> q1,q2,q3;
int n,m,q,u,v,t,sum = 0;
int MAX(){
	int x = (q1.empty() ? INT_MIN : q1.front());
	int y = (q2.empty() ? INT_MIN : q2.front());
	int z = (q3.empty() ? INT_MIN : q3.front());
	int R = max({x,y,z});
	if(x == R) q1.pop();
	else if(y == R) q2.pop();
	else q3.pop();
	return R;
}
void solve(){
	for(int i = 1;i <= m;i++){
		int num = MAX() + sum;
		if(i % t == 0) printf("%d ",num);
		int cut = 1LL * num * u / v,cut2 = num - cut;
		sum += q;
		q2.push(cut - sum);q3.push(cut2 - sum);
	}
	printf("\n");
	for(int i = 1;i <= n + m;i++){
		int num = MAX() + sum;
		if(i % t == 0) printf("%d ",num);
	}
	printf("\n");
}
signed main(){
	scanf("%d%d%d%d%d%d",&n,&m,&q,&u,&v,&t);
	vector<int> a(n + 1);
	for(int i = 1;i <= n;i++)
		scanf("%d",&a[i]);
	sort(a.begin(),a.end(),greater<int>());
	for(int i = 1;i <= n;i++)
		q1.push(a[i]);
	solve();
	return 0;
}

调了半天，样例都没过。