#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
#define int long long
int n, k, m, c, d;
int a[200005];
int check(ll mid)
{
    vector<int> b(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        if (a[i] >= mid)
            b[1]++;
        else
        {
            int pos;
            if (d != 0)
                pos = min(1LL * m, max(0LL, (mid - c - a[i] + d - 1) / d));
            else
            {
                if (a[i] + c >= mid)
                {
                    b[i]++;
                    b[i + 1]--;
                }
                continue;
            }
            int l = max(0LL, i - m + 1);
            int r = max(0LL, i - pos);
            b[l]++;
            // cout << i << ' ' << l << ' ' << r << " " << pos << '\n';

            b[r + 1]--;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        b[i] += b[i - 1];
        if (b[i] >= k)
            return 1;
    }
    return 0;
}
void solve()
{
    cin >> n >> k >> m >> c >> d;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    ll l = 0;
    ll r = 1e18;
    // cout << check(5) << '\n';
    while (l <= r)
    {
        ll mid = l + r >> 1;
        // cout << l << ' ' << r << '\n';
        if (check(mid))
        {
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }
    cout << l - 1 << '\n';
}
signed main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}