#define _GLIBCXX_DEBUG
#define ll long long
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;

int main(){
  int N, M, X, Y; cin >> N >> M >> X >> Y;
  vector<int> A;
  int UX = 0;
  for(int i = 0; i < N; i++){
    int B; cin >> B;
    if(Y < B) A.push_back(B);
    if(X <= B) UX++;
  }
  if(M < UX){
    cout << "Handicapped" << endl;
  }else{
    sort(A.rbegin(), A.rend());
    ll ans = 0;
    for(int i = 0; i < min((int)A.size(),M); i++){
      ans += A[i];
    }
    cout << ans << endl;
  }
}