def solve():
	N,M,X,Y,Z = map(int,input().split())
	keeps = []
	k_sum = 0
	others = []
	o_sum = 0
	for a in map(int, input().split()):
		if a >= X:
			keeps.append(a)
			k_sum += a
		elif a > Y:
			others.append(a)
			o_sum += a
	
	if len(keeps) > M:
		print("Handicapped")
		return
	
	dp = [[0]*(o_sum+1) for _ in range(M-len(keeps)+1)]
	
	dp[0][0] = 1
	for t in others:
		for i in range(len(dp)-2,-1,-1):
			tmp = dp[i+1]
			for s,c in enumerate(dp[i]):
				if s+t < len(tmp):
					tmp[s+t] += c

	ans = 0
	for u,ss in enumerate(dp):
		p = Z*(u+len(keeps)) - k_sum
		if 0 < p and p < len(ss):
			ans += ss[p]
	
	print(ans)
	

solve()