/* -*- coding: utf-8 -*-
 *
 * 1457.cc:  No.1457 ツブ消ししとるなHard - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;
const int MAX_A = 50;
const int MAX_S = MAX_A * MAX_N;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
ll dp[2][MAX_N + 1][MAX_S + 1];

/* subroutines */

/* main */

int main() {
  int n, m, x, y, z;
  scanf("%d%d%d%d%d", &n, &m, &x, &y, &z);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int c = 0;
  for (int i = 0; i < n; i++)
    if (as[i] >= x) c++;
  if (c > m) { puts("Handicapped"); return 0; }

  dp[0][0][0] = 1;
  int l = 0, s = 0, cur = 0, nxt = 1;

  for (int i = 0; i < n; i++) {
    if (as[i] <= y) continue;

    if (x <= as[i])
      memset(dp[nxt], 0, sizeof(dp[nxt]));
    else
      memcpy(dp[nxt], dp[cur], sizeof(dp[cur]));

    for (int j = 0; j <= l; j++)
      for (int k = 0; k <= s; k++)
	dp[nxt][j + 1][k + as[i]] += dp[cur][j][k];

    l++;
    s += as[i];
    swap(cur, nxt);
  }

  ll sum = 0;
  for (int j = 1, k = z; j <= l && j <= m && k <= s; j++, k += z)
    sum += dp[cur][j][k];

  printf("%lld\n", sum);
  return 0;
}