from bisect import bisect_left

n, m, x, y = map(int, input().split())
A = list(map(int, input().split()))

A.sort()
left = bisect_left(A, y + 1)
right = bisect_left(A, x)
if n - right > m:
    print("Handicapped")
    exit()
A = A[left:]
if len(A) > m:
    print(sum(A[-m:]))
else:
    print(sum(A))