import bisect

N,M,X,Y = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
y=bisect.bisect_right(A,Y)
x=bisect.bisect_left(A,X)

if N-x>M:
    print("Handicapped")

else:
    l=max(bisect.bisect_left(A,0),N-M,y)
    print(sum(A[l:]))