#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
int main() {
    int n, m, x, y;
    cin >> n >> m >> x >> y;
    GPQ<int> Q;
    ll S = 0;
    for (int i = 0; i < n; ++i) {
        int w;
        scanf("%d", &w);
        if(w > y){
            S += w;
            Q.emplace(w);
        }
    }
    while(Q.size() > m){
        if(Q.top() >= x) return puts("Handicapped"), 0;
        else S -= Q.top(), Q.pop();
    }
    cout << S << "\n";
    return 0;
}