#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, M, X, Y;
    cin >> N >> M >> X >> Y;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    ll ans = 0;
    vector<int> B;
    rep(i, N) {
        if (A[i] <= Y) continue;
        if (A[i] >= X) {
            ans += A[i];
            M--;
        } else {
            B.push_back(A[i]);
        }
    }
    if (M < 0) {
        cout << "Handicapped\n";
    } else {
        sort(B.begin(), B.end());
        rep(i, min(M, (int)B.size())) {
            ans += B[B.size() - 1 - i];
        }
        cout << ans << "\n";
    }
}