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

dp = [[0]*3005 for i in range(n+1)]
dp[0][0] = 1
need = 0
for a in A:
    if a <= y:
        continue
    ndp = [[0]*3005 for i in range(n+1)]
    if a >= x:
        need += 1
        for i in range(n):
            for j in range(3000):
                if dp[i][j]:
                    ndp[i+1][j+a] += dp[i][j]
    else:
        for i in range(n):
            for j in range(3000):
                if dp[i][j]:
                    ndp[i+1][j+a] += dp[i][j]
                    ndp[i][j] += dp[i][j]

    dp = ndp

if need > m:
    print("Handicapped")
    exit()
ans = 0
for i in range(1,m+1):
    ans += dp[i][i*z]

print(ans)