#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e6+3;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m,x,y,z;cin >> n >> m >> x >> y >> z;
    vector<int> a(n);
    int cnt=0;
    REP(i,n){
        cin >> a[i];
        if(a[i]>=x) cnt++;
    }
    if(cnt+m>n){
        cout << "Handicapped" << endl;
        return 0;
    }
    int sm=2500;
    vector dp(n+1,vector(n+1,vector(sm+1,0LL)));
    dp[0][0][0]=1;
    REP(i,n){
        REP(j,n){
            REP(k,sm+1){
                if(dp[i][j][k]==-1) continue;
                if(a[i]<=y) dp[i+1][j][k]+=dp[i][j][k];
                else if(a[i]>=x) dp[i+1][j+1][k+a[i]]+=dp[i][j][k];
                else{
                    dp[i+1][j][k]+=dp[i][j][k];
                    dp[i+1][j+1][k+a[i]]+=dp[i][j][k];
                }
            }
        }
    }
    ll ans=0;
    FOR(i,1,m+1) if(dp[n][i][i*z]!=-1) ans+=dp[n][i][i*z];
    cout << ans << endl;
}