#include "bits/stdc++.h"
#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, pair<ll, ll>>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
long long dp[55][5050];
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N, M, X, Y; cin >> N >> M >> X >> Y;
	int Z; cin >> Z;
	vector<int>A(N); for (int i = 0; i < N; i++)cin >> A[i];
	sort(A.begin(), A.end());
	int cnt = 0;
	for (int i = 0; i < N; i++) {
		if (A[i] >= X)cnt++;
	}
	bool ok = false;
	if (cnt == 0)ok = true;
	if (N - cnt < N - M) {
		cout << "Handicapped" << endl; return 0;
	}
	int cnt2 = 0;
	for (int i = 0; i < N; i++) {
		if (A[i] <= Y)cnt2++;
	}
	int sum = 0;
	for (int i = 0; i < N; i++) {
		if(A[i] >= X) sum += A[i];
	}
	for (int i = 0; i < N; i++) {
		A[i] -= Z;
	}
	int ans = 0;
	dp[0][2510] = 1;
	for (int i = 0; i < N - cnt2; i++) {
		for (int s = 0; s + A[cnt2 + i] < 5050; s++) {
			if (dp[i][s] == 0)continue;
			if(A[cnt2 + i] < X - Z)dp[i + 1][s] += dp[i][s];
			dp[i + 1][s + A[cnt2 + i]] += dp[i][s];
		}
	}
	if (cnt + cnt2 == N) {
		int sum = 0;
		sort(A.rbegin(), A.rend());
		for (int i = 0; i < cnt; i++) {
			sum += A[i];
		}
		if (sum == Z * cnt) {
			cout << 1 << endl;
		}
		else cout << 0 << endl;
		return 0;
	}
	if(!ok)cout << max(0LL, dp[N - cnt2][2510]) << endl;
	else cout << max(0LL, dp[N - cnt2][2510]- 1) << endl;
	return 0;
}