#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

long long N, M, X, Y, Z;
long long A[1 << 18];
long long dp[55][55][2505];

int main() {
	cin >> N >> M >> X >> Y >> Z;
	for (int i = 0; i < N; i++) cin >> A[i];
	sort(A, A + N);
	reverse(A, A + N);
	if (A[M] >= X) {
		cout << "Handicapped" << endl;
		return 0;
	}

	dp[0][0][0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= N; j++) {
			for (int k = 0; k <= 2500; k++) {
				if (dp[i][j][k] == 0) continue;
				if (A[i] > Y) {
					dp[i + 1][j + 1][k + A[i]] += dp[i][j][k];
				}
				if (A[i] < X) {
					dp[i + 1][j][k] += dp[i][j][k];
				}
			}
		}
	}

	long long Answer = 0;
	for (int i = 1; i <= M; i++) {
		Answer += dp[N][i][i * Z];
	}
	cout << Answer << endl;
	return 0;
}