import bisect

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

remove = bisect.bisect_left(A, Y+1)
remain = bisect.bisect_left(A, X)
n = remain - remove
remainSum = sum(A[remain:])
remainN = N - remain

if remainN > M:
    print("Handicapped")
elif n == 0:
    if remainSum == remainN * Z:
        print(1)
    else:
        print(0)
else:
    B = A[remove:remain]
    minM = 0 if remainN > 0 else 1
    maxM = M - remainN
    maxSum = Z * M
    dp = [[[0] * (maxSum+1) for _ in range(maxM+1)] for _ in range(n)]
    dp[0][0][0] = 1
    if B[0] <= maxSum:
        dp[0][1][B[0]] = 1
    for i in range(n-1):
        for j in range(maxM+1):
            for k in range(maxSum+1):
                dp[i+1][j][k] += dp[i][j][k]
                if j+1 <= maxM and k+B[i+1] <= maxSum:
                    dp[i+1][j+1][k+B[i+1]] += dp[i][j][k];
    cnt = 0
    for j in range(minM, maxM+1):
        k = Z*(j+remainN)-remainSum
        if k >= 0 and k <= maxSum:
            cnt += dp[n-1][j][k]
    print(cnt)