#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}


int main(){
	long long N, M, X, Y, Z; 
	cin >> N >> M >> X >> Y >> Z;
	vector<int> A;
	int cnt = 0, sum = 0;
	for(int i = 0; i < N; ++i){
	   int tmp; cin >> tmp;
   	   if(tmp>Y&&tmp<X) A.push_back(tmp);
	   if(tmp>=X){
		   sum += tmp;
		   cnt++;
	   }
	}	   
	if(cnt>M){ cout << "Handicapped" << endl; return 0;}
	N = A.size();
	vector<vector<vector<long long>>> dp(N+1, vector<vector<long long>>(M+1, vector<long long>(2501, 0)));
	dp[0][cnt][sum] = 1;
	for(int i = 0; i < N; ++i){
		for(int j = 0; j <= M; ++j){
			for(int k = 0; k <= 2500; ++k){
			//	cout << "i:" << i << ",j:" << j << ",k:" << k << endl;
				if(dp[i][j][k]){
					if(j+1<=M) dp[i+1][j+1][k+A[i]] +=dp[i][j][k];
					dp[i+1][j][k] += dp[i][j][k];
				}
			}
		}
	}
	long long ans = 0;
	for(int j = 1; j <= M; ++j){
		for(int k = 0; k <= 2500; ++k){
			if(k/j==Z&&k%j==0) ans += dp[N][j][k];
		}
	}
	cout << ans << endl;
}