#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
const long long INF = 1e9;
signed main() {
  cin.tie(0);
  cout.tie(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long cnt = 0;
  multiset<long long> best;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    long long smth = x % (a + b);
    long long dob = 0;
    if (smth == 0) {
      smth += b;
      dob++;
    }
    best.insert((smth - 1) / a + dob);
  }
  long long ans = 0;
  while (!best.empty()) {
    if (*(best.begin()) <= k) {
      k -= *(best.begin());
      ans++;
    }
    best.erase(best.begin());
  }
  cout << ans << endl;
}
