#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30);
const long long INFLL = (1ll << 60);
const long long MOD = (long long)(1e9 + 7);
void mul_mod(long long& a, long long b) {
  a *= b;
  a %= MOD;
}
void add_mod(long long& a, long long b) {
  a = (a < MOD) ? a : (a - MOD);
  b = (b < MOD) ? b : (b - MOD);
  a += b;
  a = (a < MOD) ? a : (a - MOD);
}
long long v[225816];
int main(void) {
  int n, i, ans = 0;
  long long a, b, k, h;
  scanf("%d%lld%lld%lld", &n, &a, &b, &k);
  b += a;
  for (i = 0; i < n; ++i) {
    scanf("%lld", &h);
    h %= b;
    if (!h) {
      h += b;
    }
    v[i] = (h - 1) / a;
  }
  sort(v, v + n);
  for (i = 0; i < n; ++i) {
    if (k < v[i]) {
      break;
    }
    ++ans;
    k -= v[i];
  }
  printf("%d\n", ans);
  return 0;
}
