#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
using namespace std;
typedef long long ll;
const int mod=998244353;
int main(){
	int n,m,x,y,a;
	cin>>n>>m>>x>>y;
	int cnt=0;
	ll ans=0;
	vector<int>vec;
	while(cin>>a){
		if(a<=y)
			continue;
		cnt++;
		if(a>=x)
			ans+=a;
		else
			vec.push_back(a);
	}
	sort(vec.begin(),vec.end(),greater<>());
	while(cnt>m&&vec.size()){
		cnt--;
		vec.pop_back();
	}
	if(cnt>m)
		cout<<"Handicapped"<<endl;
	else{
		for(auto x:vec)
			ans+=x;
		cout<<ans<<endl;
	}
}