#include <bits/stdc++.h>
using namespace std;
long long d[200010];
int main() {
  long long n, m, j, k, l = 0, i, a, b, flag = 0, t;
  scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
  for (i = 0; i < n; ++i) {
    scanf("%lld", &m);
    j = m % (a + b);
    if (j <= a && j != 0) {
      l++;
    } else {
      if (j == 0)
        d[flag++] = b;
      else
        d[flag++] = j - a;
    }
  }
  for (i = 0; i < flag; ++i) {
    if (d[i] % a > 0)
      t = d[i] / a + 1;
    else
      t = d[i] / a;
    d[i] = t;
  }
  sort(d, d + flag);
  for (i = 0; i < flag; ++i) {
    if (k - d[i] < 0) break;
    k -= d[i];
    l++;
  }
  printf("%lld\n", l);
  return 0;
}
