#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxm=7000010,maxn=100010;
int n,m,q,u,v,t,a[maxm],a1[maxm],a2[maxm],ans[maxm+maxn],temp;
int now=1,now1=1,now2=1,nowsize,pos,Length,b[maxm],c[maxm+maxn];
double p;
bool cmp(int x,int y)
{
    return (x>y);
}
int main()
{
    cin>>n>>m>>q>>u>>v>>t;
    p=(double)u/(double)v;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1,cmp);
    memset(a1,0,sizeof(a1));
    memset(a2,0,sizeof(a2));
    for(int i=1;i<=m;i++)
    {
        if(now>n&&a1[now1]>=a2[now2])
        {
            nowsize=a1[now1];
            now1++;
        }
        else if(now>n&&a1[now1]<=a2[now2])
        {
            nowsize=a2[now2];
            now2++;
        }
        else if(a1[now1]>=a[now]&&a1[now1]>=a2[now2])
        {
            nowsize=a1[now1];
            now1++;
        }
        else if(a2[now2]>=a[now]&&a2[now2]>=a1[now1])
        {
            nowsize=a2[now2];
            now2++;
        }
        else
        {
            nowsize=a[now];
            now++;
        }
        nowsize+=(i-1)*q;
        a1[i]=floor(p*double(nowsize));
        a2[i]=nowsize-a1[i];
        a1[i]-=i*q;
        a2[i]-=i*q;
        if(!(i%t))
            cout<<nowsize<<" ";
    }
    cout<<endl;
    for(int i=now1;i<=m;i++)
        a1[i]+=m*q;
    for(int i=now2;i<=m;i++)
        a2[i]+=m*q;
    for(int i=now;i<=n;i++)
        ans[i-now+1]=a[i]+m*q;
    pos=1;
    Length=n-now+1;
    for(int i=now1;i<=m;i++)
    {
        temp=pos;
        while(a1[i]<ans[pos]&&pos<Length)
            pos++;
        b[i]=i-now1+pos;
        for(int j=temp;j<pos;j++)
            c[j]=i-now1+j;
    }
    for(int i=pos;i<=Length;i++)
        c[i]=m+1-now1+i;
    for(int i=Length;i>0;i--)
        ans[c[i]]=ans[i];
    for(int i=now1;i<=m;i++)
        ans[b[i]]=a1[i];
    pos=1;
    Length+=m-now1+1;
    for(int i=now2;i<=m;i++)
    {
        temp=pos;
        while(a2[i]<ans[pos]&&pos<Length)
            pos++;
        b[i]=i-now2+pos;
        for(int j=temp;j<pos;j++)
            c[j]=i-now2+j;
    }
    for(int i=pos;i<=Length;i++)
        c[i]=m+1-now2+i;
    for(int i=Length;i>0;i--)
        ans[c[i]]=ans[i];
    for(int i=now2;i<=m;i++)
        ans[b[i]]=a2[i];
    for(int i=t;i<=m+n;i+=t)
        cout<<ans[i]<<" ";
    cout<<endl;
    return 0;
}