#include<bits/stdc++.h>#definedbg(x) cout << #x <<"==="<< x << endl#defineintlonglongusingnamespace std;constint N =1e5+10;int n, m, q, u, v, t;int a[N];
queue<int> b[4];intfindmax(){int res =0;for(int i =1; i <=3; i++){if(!b[i].empty()&&(!res || b[i].front()> b[res].front())) res = i;}return res;}intf(int x){return x * u / v;}signedmain(){
cin >> n >> m >> q >> u >> v >> t;for(int i =1; i <= n; i++)scanf("%lld",&a[i]);sort(a +1, a +1+ n, greater<int>());// dbg(a[1]);// dbg(a[n]);for(int i =1; i <= n; i++) b[1].push(a[i]);int diff =0;//偏移量,整个题目最难处理的东西,也是最有价值的东西for(int i =1; i <= m; i++){int x =findmax();int now = b[x].front()+ diff;
b[x].pop();
b[2].push(f(now)- diff - q);
b[3].push(now -f(now)- diff - q);
diff += q;if(i % t ==0)printf("%lld ", now);}puts("");for(int i =1; i <= n + m; i++){int x =findmax();int now = b[x].front()+ diff;
b[x].pop();if(i % t ==0)printf("%lld ", now);}return0;}