#include <bits/stdc++.h>
#define FileIO_(file) \
    freopen (file ".in", "r", stdin); \
    freopen (file ".out", "w", stdout);

using namespace std;

template<typename Tp>
inline void chmin (Tp &x, const Tp &y) { if (y < x) x = y; }
template<typename Tp>
inline void chmax (Tp &x, const Tp &y) { if (x < y) x = y; }

typedef double dbl;
typedef long long ll;
typedef long double ldb;

void init () {}

const int maxn = 5e5 + 20;
int a, b, t, r, n, pre[maxn];
ll l, p[maxn];

vector<int> ans;

#define ls (u << 1)
#define rs (ls | 1)
#define mid ((l + r) >> 1)

struct Line {
    ldb k, b;
    Line (ldb k, ldb b):
        k (k), b (b) {}
    ldb calc (ll pos) {
        return k * p[pos] + b;
    }
};

vector<Line> vlin;
vector<int> vtyp;

int newLine (ldb k, ldb b, int typ) {
    int id = vlin.size ();
    vlin.emplace_back (k, b);
    vtyp.emplace_back (typ);
    return id;
}

int tr[4 * maxn];

void modify (int u, int l, int r, int id) {
    if (vlin[id].calc (mid) < vlin[tr[u]].calc (mid)) swap (tr[u], id);
    if (vlin[id].calc (l) < vlin[tr[u]].calc (l)) modify (ls, l, mid, id);
    if (vlin[id].calc (r) < vlin[tr[u]].calc (r)) modify (rs, mid + 1, r, id);
}

void modify (int u, int l, int r, int x, int y, int id) {
    if (y < l || r < x) return;
    if (x <= l && r <= y) return modify (u, l, r, id);
    modify (ls, l, mid, x, y, id);
    modify (rs, mid + 1, r, x, y, id);
}

int query (int u, int l, int r, int p) {
    if (l == r) return tr[u];
    int oth = p <= mid ?
        query (ls, l, mid, p) :
        query (rs, mid + 1, r, p);
    return vlin[tr[u]].calc (p) <
        vlin[oth].calc (p) ? tr[u] : oth;
}

#undef ls
#undef rs
#undef mid

void solve () {
    scanf ("%lld%d%d%d%d%d", &l, &a, &b, &t, &r, &n);
    ll adis = a * t; ll bdis = adis + b * r;
    for (int i = 1; i <= n; ++i)
        scanf ("%lld", &p[i]);
    p[n + 1] = l;
    sort (p + 1, p + n + 1);
    vlin.emplace_back ((ldb) 1 / a, 0);
    vtyp.emplace_back (0);
    for (int i = 1; i <= n; ++i) {
        int id = query (1, 1, n + 1, i); pre[i] = vtyp[id];
        ldb dpv = vlin[id].calc (i);
        int ap = upper_bound (p + i + 1, p + n + 2, p[i] + adis) - p - 1;
        int bp = upper_bound (p + i + 1, p + n + 2, p[i] + bdis) - p - 1;
        modify (1, 1, n + 1, i + 1, ap, newLine ((ldb) 1 / a, dpv - (ldb) p[i] / a, i));
        modify (1, 1, n + 1, ap + 1, bp, newLine ((ldb) 1 / b, dpv + t - (ldb) (p[i] + adis) / b, i));
        modify (1, 1, n + 1, bp + 1, n + 1, newLine ((ldb) 1 / a, dpv + t + r - (ldb) (p[i] + bdis) / a, i));
    }
    int u = n + 1;
    pre[n + 1] = vtyp[query (1, 1, n + 1, n + 1)];
    while ((u = pre[u])) ans.emplace_back (u - 1);
    reverse (ans.begin (), ans.end ());
    printf ("%d\n", (int) ans.size ());
    for (int p : ans) printf ("%d ", p);
}

int main () {
    // #ifndef LSY
    // FileIO_("");
    // #endif
    int t = 1; init ();
    // scanf ("%d", &t);
    while (t--) solve ();
    return 0;
}

// #ifdef LSY
// bool ed, debug = [] () {
//     static bool st; int memtyp = 0; dbl memsiz = &st - &ed;
//     static const string memstr[] = {"B", "KB", "MB", "GB"};
//     while (memsiz >= 1024.) { ++memtyp; memsiz /= 1024.; }
//     cerr << "Memory: " << memsiz << memstr[memtyp] << endl;
//     return atexit ([] () { cerr << "Time: " << 1000. *
// 		clock () / CLOCKS_PER_SEC << "ms" << endl; });
// } ();
// #endif