#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#include <cmath>
#define int long long
using namespace std;
const int maxn=10005;

priority_queue<int> que;

inline int read(){
    int x=0,w=1;
    char ch=getchar();
    for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') w=-1;
    for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
    return x*w;
}

int n,m,q,u,v,t;
double p;
int length;

int l1,l2;
int sigma;

signed 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++){
        length=read();
        que.push(length);
    }
    for(int i=1;i<=m;i++){
        l1=0,l2=0;
        int temp;
        temp=que.top();
        que.pop();
        temp+=sigma;
        l1=floor(p*(double)temp);
        l2=temp-l1;
        l1-=sigma,l2-=sigma;
        l1-=q,l2-=q;
        que.push(l1),que.push(l2);
        if(i%t==0) cout<<temp<<' ';
        sigma+=q;
    }
    cout<<'\n';
    for(int i=1;que.size();++i){
        if(i%t==0)
            cout<<que.top()+sigma<<" ";
        que.pop();
    }
    cout<<'\n';
    return 0;
}