#include <bits/stdc++.h>
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
using namespace std;
const int MAXSIZE = 1000000;
char buf[MAXSIZE], *p1 = buf + MAXSIZE, *p2 = buf + MAXSIZE;
#define nc() (p1 == p2 && (p1 = buf,fread(buf, 1, MAXSIZE, stdin)),*p1++)
inline long long read() {
    long long x = 0;
    char ch = nc();

    while ('0' > ch || '9' < ch)
        ch = nc();

    while ('0' <= ch && ch <= '9')
        x = x * 10 + (ch ^ 48), ch = nc();

    return x;
}
char buf1[MAXSIZE], *p = buf1, *ed = buf1 + MAXSIZE;
#define pc(x) (p==ed&&(p=buf1,fwrite(buf1,1,MAXSIZE,stdout)),*p++)=x
void write(long long x) {
    if (x > 9)
        write(x / 10);

    pc(x % 10 + '0');
}
inline void flush() {
    fwrite(buf1, 1, p - buf1, stdout);
    p = buf1;
}
long long n, m, q, u, v, t;
int a[100005], b[7200005], c[7200005];
int a1 = 1, b1 = 1, c1 = 1, a2 = 1, b2 = 1, c2 = 1;
const int inf = INT_MAX - 1;
int main() {
    //  freopen("Worry.in","r",stdin);
    //  freopen("Worry.out","w",stdout);
    n = read();
    m = read();
    q = read();
    u = read();
    v = read();
    t = read();

    for (int i = 1; i <= n; i++) {
        a[i] = read();
    }

    sort(a + 1, a + n + 1);
    reverse(a + 1, a + n + 1);
    a2 = n + 1;

    for (int i = 1; i <= m; i++) {
        int ma = -inf, mb = -inf, mc = -inf;

        if (a1 != a2)
            ma = a[a1];

        if (b1 != b2)
            mb = b[b1];

        if (c1 != c2)
            mc = c[c1];

        int mx = max(ma, max(mb, mc));
        int mx1 = mx + (i - 1) * q;

        if (i % t == 0) {
            write(mx1);
            pc(' ');
        }

        int t = (u * mx1 / v);
        b[b2++] = t - i * q;
        c[c2++] = mx1 - t - i * q;

        if (ma == mx)
            a1++;
        else if (mb == mx)
            b1++;
        else
            c1++;
    }

    pc('\n');

    for (int i = 1; i <= n + m; i++) {
        int ma = -inf, mb = -inf, mc = -inf;

        if (a1 != a2)
            ma = a[a1];

        if (b1 != b2)
            mb = b[b1];

        if (c1 != c2)
            mc = c[c1];

        int mx = max(ma, max(mb, mc));

        if (i % t == 0) {
            write(mx + m * q);
            pc(' ');
        }

        if (ma == mx)
            a1++;
        else if (mb == mx)
            b1++;
        else
            c1++;
    }

    flush();
    return 0;
}