#line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <map>

using namespace std;
using lint = long long;

void solve() {
    int n, m, l, r, z;
    cin >> n >> m >> r >> l >> z;

    vector<int> xs;
    int def = 0, cnt = 0;
    while (n--) {
        int x;
        cin >> x;

        if (x <= l) {
            continue;
        } else if (x >= r) {
            def += x - z;
            ++cnt;
        } else {
            xs.push_back(x - z);
        }
    }

    if (cnt > m) {
        cout << "Handicapped\n";
        return;
    }
    n = xs.size();

    map<tuple<int, int, int>, lint> dp;
    auto dfs = [&](auto&& f, int i, int sum, int num) -> lint {
        if (i == n) {
            return sum == 0 && 0 < num && num <= m ? 1 : 0;
        }

        auto t = make_tuple(i, sum, num);
        if (dp.count(t)) return dp[t];

        auto& ret = dp[t];
        ret = 0;

        for (int k = 0; k < 2; ++k) {
            auto nsum = sum + xs[i] * k;
            auto nnum = num + k;
            ret += f(f, i + 1, nsum, nnum);
        }
        return ret;
    };

    cout << dfs(dfs, 0, def, cnt) << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}