#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

int arr[200005], ub[200005];
vector<ll> gap;

int lt(ll x) {
    return lower_bound(ALL(gap), x) - gap.begin();
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m, x, y, a1;
    cin >> n >> m >> x >> y >> a1, --n;
    for (int i = 0; i < n; ++i)
        cin >> arr[i];
    if (n == 0)
        return cout << a1 + y + (ll)m * x << "\n", 0;
    priority_queue<ll, vector<ll>, greater<ll>> pq;
    for (int i = 0; i < n; ++i)
        pq.push(arr[i]);
    while (SZ(gap) <= m) {
        gap.pb(pq.top());
        ll t = pq.top() + x;
        pq.pop(), pq.push(t);
    }
    ll ans = a1 + y;
    ub[m + 1] = 0;
    for (int i = m; i >= 1; --i) {

        auto check = [&](ll mid) {
            return i + lt(a1 + mid + (ll)(i - 1) * x) > m; 
        };

        if (check(0)) {
            ub[i] = 0;
        }
        else {
            int l = 0, r = y + 1;
            while (r - l > 1) {
                int mid = (l + r) >> 1;
                if (check(mid))
                    r = mid;
                else
                    l = mid;
            }
            ub[i] = r;
            // [ub[i + 1], ub[i])
            if (ub[i + 1] < ub[i])
                ans = max(ans, (ll)i * x + a1 + ub[i] - 1);
        }
    }
    cout << ans << "\n";
}