#include<cstdio>
#include<algorithm>
struct queue2 {
int data[100003+7000003];
int hd,tl;
queue2() {hd=1,tl=1,data[1]=-211111111;}
inline void push(int o) {data[tl++]=o,data[tl]=-2111111111;}
inline void pop() {++hd;}
inline int head() {return data[hd];}
inline void out(int u){for(int i=hd;i^tl;i++)printf("%d ",data[i]+u);puts("");}
} quel,ques;
int num[100003],hd=1;
inline int gi() {
char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
int x=0;
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x;
}
bool cmp(int a,int b) {
return a>b;
}
int main() {
// freopen("earthworm.in","r",stdin);
// freopen("earthworm.out","w",stdout);
int n=gi(),m=gi(),q=gi(),u=gi(),v=gi(),t=gi(),Min,*N;
for(int i=1; i<=n; i++)num[i]=gi();
num[n+1]=-2111111111;
std::sort(num+1,num+1+n,cmp);
for(int i=1; i<=m; i++) {
if(num[hd]>quel.head())
if(num[hd]>ques.head())N=&num[hd];
else N=&ques.data[ques.hd];
else
if(quel.head()>ques.head())N=&quel.data[quel.hd];
else N=&ques.data[ques.hd];
int K=*N+i*q-q;
if(!(i%t))printf("%d ",K);
ques.push(int((((double)K)*u/v))-i*q),quel.push(K-int((((double)K)*u/v))-i*q);
if(N==&num[hd])++hd;
else if(N==&ques.data[ques.hd])ques.pop();
else quel.pop();
}
puts("");
int H=(n+m)/t;
while(H--){
for(int i=1;i<t;i++)
if(num[hd]>quel.head())
if(num[hd]>ques.head())++hd;
else ques.pop();
else
if(quel.head()>ques.head())quel.pop();
else ques.pop();
if(num[hd]>quel.head())
if(num[hd]>ques.head())N=&num[hd];
else N=&ques.data[ques.hd];
else
if(quel.head()>ques.head())N=&quel.data[quel.hd];
else N=&ques.data[ques.hd];
printf("%d ",*N+m*q);
if(N==&num[hd])++hd;
else if(N==&ques.data[ques.hd])ques.pop();
else quel.pop();
}
return 0;
}
不得不说手写队列真是快