#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

int main(){
    int n, m, x, y; cin >> n >> m >> x >> y;
    VI a(n); REP(i,n) cin >> a[i];
    sort(ALL(a),greater<ll>());
    ll ans=0;
    REP(i,n){
        if(i<m){
            if(a[i]<=y)
                break;
            ans+=a[i];
        }
        else{
            if(a[i]>=x){
                cout << "Handicapped" << endl;
                return 0;
            }
            else
                break;
        }
    }
    cout << ans << endl;
    return 0;
}