#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}


int main() {
	int n = ri();
	int m = ri();
	int x = ri();
	int y = ri();
	int erased = 0;
	int used = 0;
	std::vector<int> a;
	int64_t sum = 0;
	for (int i = 0; i < n; i++) {
		int cur = ri();
		if (cur <= y) erased++;
		else if (cur >= x) sum += cur, used++;
		else a.push_back(cur);
	}
	std::sort(a.begin(), a.end());
	
	std::cerr << used << " " << m << " " << a.size() << std::endl;
	if (used > m) {
		puts("Handicapped");
	} else {
		sum += std::accumulate(a.end() - std::min((int) a.size(), (m - used)), a.end(), 0);
		printf("%" PRId64 "\n", sum);
	}
	return 0;
}