#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=2000010;



signed main(){
    ll n,m,x,y,z;cin>>n>>m>>x>>y>>z;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    vector<ll>b(0);
    ll sum=0,cnt=0;
    rep(i,n){
        if(a[i]<=y)continue;
        else if(a[i]>=x){
            sum+=a[i];
            cnt++;
        }else{
            b.pb(a[i]);
        }
    }
    if(cnt>m){
        cout<<"Handicapped"<<endl;
        return 0;
    }
    ll l=b.size();
    vector<vector<vector<ll> > >dp(l+1,vector<vector<ll> >(m+1,vector<ll>(2501)));
    dp[0][cnt][sum]=1;
    rep(i,l){
        rep(j,m+1){
            rep(k,2501){
                if(j<m&&k+b[i]<2501)dp[i+1][j+1][k+b[i]]+=dp[i][j][k];
                dp[i+1][j][k]+=dp[i][j][k];
            }
        }
    }
    ll ans=0;
    rep(j,m+1){
        REP(k,1,2501){
            if(k==j*z)ans+=dp[l][j][k];
        }
    }
    cout<<ans<<endl;
}