#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M, X, Y;
  cin >> N >> M >> X >> Y;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B;
  for (int i = 0; i < N; i++){
    if (A[i] > Y){
      B.push_back(A[i]);
    }
  }
  int N2 = B.size();
  sort(B.begin(), B.end());
  if (B.end() - lower_bound(B.begin(), B.end(), X) > M){
    cout << "Handicapped" << endl;
  } else {
    long long ans = 0;
    for (int i = 0; i < min(N2, M); i++){
      ans += B[N2 - 1 - i];
    }
    cout << ans << endl;
  }
}