#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, h[200010];
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  int ans = 0, x;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    if (x % (a + b) == 0)
      x -= (x / (a + b) - 1) * (a + b);
    else
      x -= (x / (a + b)) * (a + b);
    if (x <= a)
      ans++;
    else {
      if (x % a == 0)
        x = x / a - 1;
      else
        x = x / a;
      h[i] = x;
    }
  }
  sort(h + 1, h + 1 + n);
  for (int i = 1; i <= n; i++)
    if (h[i] > 0 && k >= h[i]) k -= h[i], ans++;
  printf("%d\n", ans);
  return 0;
}
