#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define rrep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define HOUT(S) cout << setprecision(50) << S << endl
#define pint pair<ll, ll>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 10000010
#define endl "\n"
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }

template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U& u, const V... v) {
    u = U(v...);
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U& u, const V... v) {
    for (auto& e : u) fill_v<T>(e, v...);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N, M, X, Y, Z;
    cin >> N >> M >> X >> Y >> Z;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    Sort(A);
    ll res = 0, cnt = N - 1, row = 0;
    while(A[cnt] >= X && cnt >= 0) {
        res += A[cnt];
        cnt--;
    }
    if(cnt + 1 < N - M) {
        cout << "Handicapped" << endl;
        return 0;
    }
    while(A[row] <= Y && row < N) row++;
    cnt++;
    auto dp = make_v<ll>(N + 1, M + 2, 3000);
    fill_v<ll>(dp, 0);
    dp[row][N - cnt][res]++;
    dp[row][N - cnt + 1][res + A[row]]++;
    rep(i, row, cnt) rep(j, 0, M + 1) rep(k, 0, 2600) {
        dp[i + 1][j][k] += dp[i][j][k];
        if(i + 1 < cnt) dp[i + 1][j + 1][k + A[i + 1]] += dp[i][j][k];
    }
    ll ans = 0;
    rep(i, 1, M + 1) ans += dp[cnt][i][i * Z];
    cout << ans << endl;
}