#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll solve() {
    int n, m, x, y, z;
    cin >> n >> m >> x >> y >> z;
    VI a;
    int rest = m, tot = 0;
    rep(_, n) {
        int t;
        cin >> t;
        if (t <= y) continue;
        if (t >= x) tot += t, rest--;
        else a.push_back(t);
    }
    if (rest < 0) return -1;
    constexpr int MX = 50 * 50 + 1;
    VVL dp(MX, VL(rest + 1));
    dp[0][rest] = 1;
    for(int t: a) {
        VVL ndp(MX, VL(rest + 1));
        rrep(i, MX) rep(j, rest + 1) {
            ndp[i][j] += dp[i][j];
            int ni = i + t;
            int nj = j - 1;
            if (0 <= ni && ni < MX && 0 <= nj && nj < rest + 1) ndp[ni][nj] += dp[i][j];
        }
        swap(dp, ndp);
    }
    ll ans = 0;
    rep(j, rest + 1) {
        int cnt = m - j;
        if (cnt == 0) continue;
        int zc = z * cnt;
        int r = zc - tot;
        if (r >= 0) ans += dp[r][j];
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll ans = solve();
    if (ans == -1) {
        cout << "Handicapped" << '\n';
    } else {
        cout << ans << '\n';
    }
}