#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
#define v(t) vector<t>
#define p(t) pair<t, t>
#define p2(t, s) pair<t, s>
#define vp(t) v(p(t))

#define rep(i, n) for (int i=0,i##_len=((int)(n)); i<i##_len; ++i)
#define rep2(i, a, n) for (int i=((int)(a)),i##_len=((int)(n)); i<=i##_len; ++i)
#define repr(i, n) for (int i=((int)(n)-1); i>=0; --i)
#define rep2r(i, a, n) for (int i=((int)(n)),i##_len=((int)(a)); i>=i##_len; --i)

#define repi(itr, c) for (__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); ++itr)
#define repir(itr, c) for (__typeof((c).rbegin()) itr=(c).rbegin(); itr!=(c).rend(); ++itr)

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define eb emplace_back

#define INF (1e9)
#define LINF (1e18)
#define PI (acos(-1))
#define EPS (1e-7)
#define DEPS (1e-10)

int main(){
    int n, m, x, y, z;
    cin >> n >> m >> x >> y >> z;
    v(int) a(n);
    rep(i, n) cin >> a[i];
    v(int) a1, a2;
    rep(i, n) {
        if (a[i] >= x) a1.pb(a[i]);
        else if (a[i] > y) a2.pb(a[i]);
    }
    int n1 = sz(a1), n2 = sz(a2), k = m - n1;
    if (k < 0) {
        cout << "Handicapped" << endl;
        return 0;
    }
    int sum = 0;
    rep(i, n1) sum += a1[i];
    int mval = z*n2;
    v(v(ll)) dp(mval+1, v(ll)(n2+1));
    dp[0][0] = 1;
    rep(i, n2) {
        repr(j1, mval+1-a2[i]) repr(j2, i+1) {
            if (dp[j1][j2] == 0) continue;
            dp[j1+a2[i]][j2+1] += dp[j1][j2];
        }
    }
    ll ans = 0;
    rep(i, n2+1) {
        if (i > k) break;
        if (i+n1 == 0) continue;
        int tar = z * (n1 + i) - sum;
        if (tar<0 || tar>mval) continue;
        ans += dp[tar][i];
    }
    cout << ans << endl;
    return 0;
}