#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
using ll = long long;
const ll dx[4] = {1,0,-1,0};
const ll dy[4] = {0,1,0,-1};
ll mod(ll x, ll m){return x & m;}
ll modinv(ll a, ll m) {
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}
ll yaku(ll x){
    ll cnt = 0;
    for(int i = 1; i * i <= x; i++){
        if(x % i == 0){
            if(i == x / i) cnt++;
            else cnt += 2;
        }
    }
    return cnt;
}
ll modwaru(ll a, ll b, ll m){
    a %= m;
    return a * modinv(b, m) % m;
}
ll gcd(ll x, ll y){
    if(x % y == 0)return y;
    else return gcd(y, x % y); 
}

int main(){
    ll N, M, X, Y, ans = 0, gen;
    cin >> N >> M >> X >> Y;
    vector<ll> A(N);
    gen = N;
    bool b = true;
    for(int i = 0; i < N; i++){
        cin >> A[i];
        ans += A[i];
    }
    sort(A.begin(), A.end());
    for(int i = 0; i < N; i++){
        if(A[i] <= Y){
            ans -= A[i];
            gen--;
            continue;
        }
        if(A[i] >= X) continue;
        if(gen > M){
            ans -= A[i];
            gen--;
        } 
    }
    if(gen > M) cout << "Handicapped" << endl;
    else cout << ans << endl;
}