#!/usr/bin/env python3
import sys
import bisect

def main():
    N, M, X, Y = map(int, input().split())
    A = list(map(int, input().split()))
    A.sort()
    # print(A)
    l = bisect.bisect_right(A, Y)
    A = A[l:]
    r = bisect.bisect_left(A, X)
    rest = M - len(A[r:])
    if rest < 0:
        print("Handicapped")
        return
    if r - rest < 0:
        print(sum(A))
    else:
        print(sum(A[(r - rest):]))
    return
        
if __name__ == '__main__':
    main()