from bisect import *

N,M,X,Y = map(int,input().split())
A = list(map(int,input().split()))
A.sort()

y = bisect_right(A,Y)
x = bisect_left(A,X)
if N-x > M:
    print("Handicapped")
else:
    l = max(bisect_left(A,0),N-M,y)
    print(sum(A[l:]))