#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept: itr(pos) { }
        constexpr void operator ++ () noexcept { ++itr; }
        constexpr bool operator != (const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator * () const noexcept { return itr; }
    };
    const Iter first, last;
public:
    explicit constexpr rep(const usize first, const usize last) noexcept: first(first), last(std::max(first, last)) { }
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T>
using Vec = std::vector<T>;

void E_main() {
    usize N, M;
    std::cin >> N >> M;
    u32 X, Y, Z;
    std::cin >> X >> Y >> Z;
    u32 sum = 0;
    usize cnt = 0;
    Vec<u32> vec;
    for (auto _: rep(0, N)) {
        u32 a;
        std::cin >> a;
        if (a <= Y) continue;
        if (a >= X) {
            sum += a;
            cnt += 1;
        }
        else {
            vec.push_back(a);
        }
    }
    if (cnt > M) {
        std::cout << "Handicapped\n";
        return;
    }
    const auto size = vec.size();
    Vec<Vec<u64>> dp(size + 1, Vec<u64>(50 * size + 1));
    dp[0][0] = 1;
    for (const auto x: vec) {
        Vec<Vec<u64>> next(size + 1, Vec<u64>(50 * size + 1));
        for (auto i: rep(0, size + 1)) {
            for (auto j: rep(0, 50 * size + 1)) {
                if (dp[i][j] == 0) {
                    continue;
                }
                next[i][j] += dp[i][j];
                next[i + 1][j + x] += dp[i][j];
            }
        }
        dp = std::move(next);
    }
    u64 ans = 0;
    for (auto i: rep(0, size + 1)) {
        for (auto j: rep(0, 50 * size + 1)) {
            if (0 < cnt + i and cnt + i <= M and Z * (cnt + i) == sum + j) {
                ans += dp[i][j];
            }
        }
    }
    std::cout << ans << '\n';
    return;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    E_main(); 
    return 0;
}