#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

int main(){
    int n, m, x, y, z; cin >> n >> m >> x >> y >> z;
    VI a(n); REP(i,n) cin >> a[i];
    VI b;
    int sum=0, c=0;
    REP(i,n){
        if(a[i]>=x){
            c++;
            sum+=a[i];
        }
        else if(a[i]>y){
            b.push_back(a[i]);
        }
    }
    if(c>m){
        cout << "Handicapped" << endl;
    }
    else{
        ll dp[60][60][3100];
        dp[0][0][sum]=1;
        int s=b.size();
        REP(i,s){
            REP(j,s){
                REP(k,3000){
                    dp[i+1][j][k]+=dp[i][j][k];
                    dp[i+1][j+1][k+b[i]]+=dp[i][j][k];
                }
            }
        }
        ll ans=0;
        REP(i,s+1){
            if(c+i>m)
                break;
            if(c==0&&i==0)
                continue;
            ans+=dp[s][i][z*(c+i)];
        }
        cout << ans << endl;
    }
    return 0;
}