#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")

using ll = long long;
//using i128 = __int128_t;
#define endl "\n"
#define int long long
#define db cout << "db" << endl;
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 5e5 + 10;
ll inf = 2e18;
void solve() {
    int n, k, m, c, d;
    cin >> n >> k >> m >> c >> d;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
    	cin >> a[i];
    }

    int l = 0, r = 1e18 + 10;
    while (l <= r) {
    	int mid = (l + r) >> 1;
    	vector<int> s(n + 2, 0);
    	for (int i = 1; i <= n; i++) {
    		if (a[i] >= mid) {
    			s[0]++;
    			continue;
    		}
    		int x;
    		if (!d) {
    			x = (a[i] + c >= mid ? 0 : 1e15);

    			if (a[i] + c >= mid) {
    				s[max(1LL, i - m + 1)]++;
    				s[i + 1]--;
    			}
    		} else {
    			int dis = (mid - a[i] - c);

    			if (dis <= 0) {
    				s[max(1LL, i - m + 1)]++;
    				s[i + 1]--;
    			} else {
    				x = (dis - 1 + d) / d;
    				x++;
    				if (x > m || x > i) {
    					continue;
    				} else {
    					s[max(1LL, i - m + 1)]++;
    					s[i - x + 1]--;
    				}

    			}
    			//x = (dis <= 0 ? 0 : (dis - 1 + d) / d);
    			//x = ((a[i] + c >= mid ? 0 : mid - a[i] - c + d - 1) / d);
    		}
    		//int p1 = max(i - x + 1, 0LL), p2 = max(i - m + 1, 0LL);
    		//p1 = max(p1, p2);
    		//s[p1]--;
    		//s[p2]++;
    	}
    	int mx = 0, res = 0;
    	for (int i = 0; i <= n; i++) {
    		res += s[i];
    		mx = max(mx, res);
    	}
    	if (mx >= k) {
    		l = mid + 1;
    	} else {
    		r = mid - 1;
    	}
    }
    cout << r << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int q = 1;
    //cin >> q;
    while (q --) {
        solve();
    }
    return 0;
}