#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,M,X,Y,Z;
int A[50];
ll dp[51][51][2501]={};

int main(){
  scanf("%d%d%d%d%d",&N,&M,&X,&Y,&Z);
  rep(i,N) scanf("%d",&A[i]);
  dp[0][0][0]=1;
  rep(i,N) rep(k,i+1) rep(s,50*i+1){
    if(A[i]>Y) dp[i+1][k+1][s+A[i]] += dp[i][k][s];
    if(A[i]<X) dp[i+1][k][s] += dp[i][k][s];
  }
  bool Handicapped = true;
  for(int k=1; k<=M; k++) rep(s,2501) if(dp[N][k][s]!=0) Handicapped = false;
  if(Handicapped){ printf("Handicapped\n"); return 0; }
  ll ans=0;
  for(int k=1; k<=M; k++) ans+=dp[N][k][Z*k];
  printf("%lld\n",ans);
  return 0;
}