#include<iostream>
#include<cstdio>
#include<queue>
#include<vector> 
#include<cstring> 
#include<algorithm>
using namespace std; 
long long n,m,q,u,v,t,a,sq[10000005];
struct cmp{  bool operator() (long long&a,long long &b)  {return a<b;}  };  
priority_queue<long long,vector<long long>,cmp>q1;
int main()
{
	freopen("earthworm.in","r",stdin);freopen("earthworm.out","w",stdout);
    scanf("%d%d%d%d%d%d",&n,&m,&q,&u,&v,&t);
    for(int i=1;i<=n;i++){scanf("%d",&a);q1.push(a);}
    long long k,r=0;
    while(r<m)
    {
        ++r;
        if(r%t==0)
            printf("%d ",q1.top());
        sq[1]=(u*q1.top())/v;sq[2]=q1.top()-sq[1];q1.pop();
        k=2;
        while(!q1.empty())sq[++k]=q1.top()+q,q1.pop() ; 
        for(long long i=1;i<=k;i++)
            q1.push(sq[i]);
    }
    printf("\n");r=0;
    while(!q1.empty()){r++;if(r%t==0)printf("%d ",q1.top());q1.pop();}
    printf("\n");
    fclose(stdin);fclose(stdout);
    return 0;
}