#include <bits/stdc++.h>
using namespace std;
int main() {
  int t = 1;
  while (t--) {
    long long n, a, b, k, i, su;
    cin >> n >> a >> b >> k;
    vector<long long> v(n), ar(n);
    su = a + b;
    for (i = 0; i < n; i++) cin >> v[i];
    for (i = 0; i < n; i++) {
      long long r = v[i] % (su);
      if (r == 0) {
        double d = v[i] - ((v[i] / su) - 1) * su;
        ar[i] = ceil(d / a) - 1;
      } else if (r > 0) {
        if (r <= a)
          ar[i] = 0;
        else {
          double d = r;
          ar[i] = ceil(d / a) - 1;
        }
      }
    }
    sort(ar.begin(), ar.end());
    long long ans = 0, c = 0;
    for (i = 0; i < n; i++) {
      if ((c + ar[i]) <= k) {
        ans++;
        c += ar[i];
      } else
        break;
    }
    cout << ans << endl;
  }
  return 0;
}
