Untitled

#include <bits/stdc++.h>
using namespace std;

#define Task "HOLDING"
#define ll long long
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)

const int N = 1e6 + 6;
const int INF = 1e9;
const int MOD = 1e9 + 7;

template<class X, class Y>
    bool minimize(X &x, Y y) {
        if (x > y) {
            x = y;
            return true;
        } else return false;
    }

template<class X, class Y>
    bool maximize(X &x, Y y) {
        if (x < y) {
            x = y;
            return true;
        } else return false;
    }

int n, l, r, k;
int a[N];

namespace sub2 {
    int dp[55][55][10004];

    void solve() {
        memset(dp, 0, sizeof(dp));
        FOR(i, 1, l - 1) FOR(j, l, r) FOR(h, 0, k) {
            dp[i][j][h] = max(dp[i - 1][j][h], dp[i][j - 1][h]);
            int cost = j - i;
            if (h >= cost)
                maximize(dp[i][j][h], dp[i - 1][j - 1][h - cost] + a[j] - a[i]);
        }
        int sum = 0, sub = 0;
        FOR(i, l, r) sum += a[i];
        FOR(i, 1, l - 1) FOR(h, 0, k) maximize(sub, dp[i][n][h]);
        cout << sum - sub;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(Task".INP", "r")) {
        freopen(Task".INP", "r", stdin);
        freopen(Task".OUT", "w", stdout);
    }

    cin >> n >> l >> r >> k;
    FOR(i, 1, n) cin >> a[i];

    if (n <= 50 && r == n) sub2::solve();

    return 0;
}