#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

using ll = long long;

ll first_green(ll const cur_t, ll const t) {
    ll cycle = cur_t % (2 * t);

    if (cycle < t)
        return cur_t;
    else
        return cur_t / (2 * t) * (2 * t) + 2 * t;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, r, t, l;
    cin >> n >> r >> t >> l;

    vector<ll> x(n);
    for (ll& y : x)
        cin >> y;

    vector<ll> dp(r + 1);

    for (int i = 0; i <= r; i++)
        dp[i] = x[0];

    for (int i = 0; i < n; i++) {
        // get through lamp
        for (int j = r; j >= 1; j--) {
            dp[j] = min(first_green(dp[j], t), dp[j - 1]);
        }
        dp[0] = first_green(dp[0], t);

        // to next lamp
        if (i != n - 1) {
            for (int j = 0; j <= r; j++)
                dp[j] += x[i + 1] - x[i];
        }
    }

    cout << dp[r] + l - x.back() << "\n";
}