#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <ios>
#include <iomanip>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <sstream>
#include <bitset>
#include <climits>
#include <stack>
#include <regex>
#include <functional>
#include <random>
#ifdef _WIN64
#  include <atcoder/all>
#endif
#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#  define __builtin_popcountl __popcnt64
#endif

using namespace std;

#define ll long long
#define rep(i, init, n) for(ll i = init; i < (ll)n; i++)
#define rrep(i, init, n) for(ll i = init; i >= (ll)n; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) (ll)(x.size())
#define Out(x) cout << x << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define Ans cout << ans << endl
#define PI 3.14159265358979
#define MOD 998244353

const int inf32 = INT_MAX / 2;
const ll inf64 = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }

// -------------------------------------------------------------------------------------------------

int main()
{
	int n, m, x, y, z; cin >> n >> m >> x >> y >> z;
	vector<int> a(n + 1);
	rep(i, 1, n + 1) cin >> a[i];

	int cnt = 0;
	for (int v : a) if (x <= v) cnt++;
	if (cnt > m) { Out("Handicapped"); return 0; }

	vector dp(n + 1, vector(n + 5, vector<ll>(2500 + 100)));
	dp[0][0][0] = 1;

	rep(i, 1, n + 1)rep(j, 0, n + 1)rep(k, 0, 2500 + 1)
	{
		if (a[i] <= y) dp[i][j][k] += dp[i - 1][j][k];
		else if (x <= a[i]) dp[i][j + 1][k + a[i]] += dp[i - 1][j][k];
		else
		{
			dp[i][j][k] += dp[i - 1][j][k];
			dp[i][j + 1][k + a[i]] += dp[i - 1][j][k];
		}
	}

	ll ans = 0;
	rep(i, 1, m + 1) ans += dp[n][i][z * i];

	Ans;

	return 0;
}