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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m, x, y, z;
  cin >> n >> m >> x >> y >> z;
  vector<int> a(n);
  int rem = 0;
  rep(i, n) {
    cin >> a[i];
    rem += a[i] >= x;
  }
  if (rem > m) {
    cout << "Handicapped" << '\n';
    return 0;
  }
  constexpr int w = 2500;
  vector dp(n + 1, vector(m + 1, vector<ll>(w + 1, 0)));
  dp[0][0][0] = 1;
  rep(i, n) {
    rep(j, m + 1) rep(k, w + 1) {
      // 残す
      if (a[i] > y && j + 1 <= m && k + a[i] <= w) dp[i + 1][j + 1][k + a[i]] += dp[i][j][k];
      // 消す
      if (a[i] < x) dp[i + 1][j][k] += dp[i][j][k];
    }
  }
  ll ans = 0;
  rep(j, m) ans += dp[n][j + 1][(j + 1) * z];
  cout << ans << '\n';
  return 0;
}