#include <bits/stdc++.h>
using namespace std;using ll=long long;
#define rep(i,r) for(ll i=0;i<(r);i++)
#define Rep(i,l,r) for(ll i=(l);i<(r);i++)
ll dp[51][51][2501];
int main()
{
    ll n,m,x,y,z,cnt=0,sum=0;
    cin>>n>>m>>x>>y>>z;
    vector<ll>v;
    rep(i,n)
    {
        ll a;
        cin>>a;
        if(a>y)v.push_back(a);
        if(a>=x)cnt++,sum+=a;
    }
    if(cnt>m)
    {
        cout<<"Handicapped"<<endl;return 0;
    }
    sort(v.rbegin(),v.rend());
    rep(i,51)rep(j,51)rep(k,2501)
    {
        dp[i][j][k]=0;
    }
    dp[cnt][cnt][sum]=1;
    n=v.size();
    Rep(i,cnt+1,n+1)Rep(j,cnt,n+1)rep(k,2501)
    {
        dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-v[i-1]];
    }
    ll ans=0;
    rep(i,m+1)ans+=dp[n][i][z*i];
    cout<<ans<<endl;
}