#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M, X, Y, Z;
  cin >> N >> M >> X >> Y >> Z;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  int g = 0, sum = 0;
  for (int i = 0; i < N; i++){
    if (A[i] >= X){
      g++;
      sum += A[i];
    }
  }
  if (g > M){
    cout << "Handicapped" << endl;
  } else {
    vector<int> B;
    for (int i = 0; i < N; i++){
      if (Y < A[i] && A[i] < X){
        B.push_back(A[i]);
      }
    }
    int cnt = B.size();
    int S = 0;
    for (int i = 0; i < cnt; i++){
      S += B[i];
    }
    vector<vector<vector<long long>>> dp(cnt + 1, vector<vector<long long>>(cnt + 1, vector<long long>(S + 1, 0)));
    dp[0][0][0] = 1;
    for (int i = 0; i < cnt; i++){
      for (int j = 0; j <= i; j++){
        for (int k = 0; k <= S; k++){
          if (dp[i][j][k] > 0){
            dp[i + 1][j][k] += dp[i][j][k];
            dp[i + 1][j + 1][k + B[i]] += dp[i][j][k];
          }
        }
      }
    }
    long long ans = 0;
    for (int i = 0; i <= cnt; i++){
      for (int j = 0; j <= S; j++){
        if (0 < g + i && g + i <= M && sum + j == (g + i) * Z){
          ans += dp[cnt][i][j];
        }
      }
    }
    cout << ans << endl;
  }
}