#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    //cout << -2 << endl;
    ll n,m,x,y,z;
    cin >> n >> m >> x >> y >> z;
    ll wa = 0;
    ll ka = 0;
    vector<ll> a;
    for(int i = 0;i < n;i++){
        ll in;
        cin >> in;
        if(in >= x)wa += in,ka++;
        else if(in > y){
            a.push_back(in);
        }
    }
    if(ka > m){
        cout << "Handicapped" << endl;
        return 0;
    }
    //cout << 1 << endl;
    //cout << a.size() << endl;
    ll dp[51][51][2501];//i番目まででjつ選んで合計がkの時の通り数
    for(int i = 0;i < 50;i++)for(int j = 0;j < 51;j++)for(int k = 0;k < 2501;k++)dp[i][j][k] = 0;
    dp[0][0][0] = 1;
    for(int i = 0;i < a.size();i++){
        //cout << a[i] << " ";
        if(i == 0)dp[i][1][a[i]] = 1;
        else{
            for(int j = 0;j < 2501;j++){
                for(int k = 0;k <= 50;k++){
                    dp[i][k][j] = dp[i - 1][k][j];
                    if(j - a[i] < 0 || k == 0)continue;
                    dp[i][k][j] += dp[i - 1][k - 1][j - a[i]];
                    //if(i == 2 && k == 1 && j == 4)cout << "!!!!!" << a[i] << " " << dp[i - 1][k - 1][j - a[i]] << endl;
                }
            }
        }
    }
    //cout << "% " << dp[0][0][0] << " " << dp[1][0][0] << " " << dp[2][0][0] << endl;
    //cout << endl;
    //cout << dp[1][2][8] << endl;
    //cout << ka << " " << wa << endl;
    if(a.size() == 0){
        if(ka * z == wa){
            cout << 1 << endl;
            return 0;
        }
        else{
            cout << 0 << endl;
            return 0;
        }
    }
    ll res = 0;
    for(int i = 0;i < 51;i++){
        for(int j = 0;j < 2501;j++){
            if(i + ka <= 0)continue;
            if((i + ka) * z == wa + j){
                //cout << "!" << " " << i << " " << j << " " << dp[a.size() - 1][i][j] << endl;
                res += dp[a.size() - 1][i][j];
            }
        }
    }
    cout << res << endl;
}