#line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>

using namespace std;
using lint = long long;

void solve() {
    int n, m, r, l;
    cin >> n >> m >> r >> l;

    vector<lint> xs;
    lint sum = 0;
    while (n--) {
        lint x;
        cin >> x;

        if (x <= l) {
            continue;
        } else if (x >= r) {
            sum += x;
            --m;
        } else {
            xs.push_back(x);
        }
    }

    if (m < 0) {
        cout << "Handicapped\n";
        return;
    }

    sort(xs.begin(), xs.end());
    while (m > 0 && !xs.empty()) {
        sum += xs.back();
        xs.pop_back();
        --m;
    }

    cout << sum << "\n";
}

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

    solve();

    return 0;
}