#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long dp[51][2505];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, M, X, Y, Z;
	cin >> N >> M >> X >> Y >> Z;
	vector<int>A(N);
	rep(i, N) { cin >> A[i]; }
	int count = 0;
	int sum = 0;
	vector<int>B;
	rep(i, N) {
		if (Y >= A[i]) { continue; }
		if (A[i] >= X) {
			count++;
			sum += A[i];
		}
		else {
			B.push_back(A[i]);
		}
	}
	if (count > M) { cout << "Handicapped" << endl; return 0; }
	dp[count][sum] = 1;
	rep(i, B.size()) {//50
		rrep(j, 50) {//50
			rrep(k, 2500) {//2500
				dp[j + 1][k + B[i]] += dp[j][k];
			}
		}
	}
	long long ans = 0;
	rep2(i, 1, 51) {
		ans += dp[i][i*Z];
	}
	cout << ans << endl;
	return 0;
}