from collections import deque
import bisect
N, M, X, Y = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A = deque(A)
while A and A[0]<=Y:
    A.popleft()
pos = bisect.bisect_left(A, X)
if len(A)-pos>M:
    print("Handicapped")
    exit()
while len(A)>M:
    A.popleft()
print(sum(A))