#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int main() {
	ll N, M, X, Y;
	cin >> N >> M >> X >> Y;

	vector<ll> A(N), ck(N);
	ll cnt = 0, tot = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		if (A[i] >= X) {
			ck[i] = 2;
			cnt++;
			tot += A[i];
		}
		if (A[i] <= Y) ck[i] = 1;
	}

	if (cnt > M) cout << "Handicapped" << endl;
	else {
		vector<ll> v;
		for (int i = 0; i < N; i++) {
			if (!ck[i]) v.push_back(A[i]);
		}
		sort(v.begin(), v.end());
		reverse(v.begin(), v.end());
		ll s = v.size();
		for (int i = 0; i < min(M - cnt,s); i++) tot += v[i];
		cout << tot << endl;
	}

	return 0;
}