#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
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 (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
   ll n,m,x,y,z;
   cin>>n>>m>>x>>y>>z;
   V<ll> a(n);
   ll sum=0;
   ll num=0;
   for(int i=0;i<n;i++){
        cin>>a[i];
        if(a[i]>y){
            sum+=a[i];
            num++;
        }
   }
   sort(all(a));
   while(a.size()&&a.back()>=x)a.pop_back();
   reverse(all(a));
   while(a.size()&&a.back()<=y)a.pop_back();
   n=a.size();
   V<V<ll>> dp(num+1,V<ll>(sum+1,0));
   dp[num][sum]=1;
   for(int i=0;i<n;i++){
         for(int j=2;j<=num;j++){
             for(int k=0;k<=sum;k++){
                 if(k>=a[i])dp[j-1][k-a[i]]+=dp[j][k];
             }
         }
   }
   ll ans=0;
   bool ok=false;
   for(int i=1;i<=min(num,m);i++){
         for(int j=0;j<=sum;j++){
               if(j%i==0&&j/i==z)ans+=dp[i][j];
               if(dp[i][j]>0)ok=true;
         }
   }
   if(!ok)cout<<"Handicapped"<<"\n";
   else cout<<ans<<"\n";
}