#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y / 2;
    x = (x * x) % p;
  }
  return res;
}
void solve() {
  long long int n, a, b, k;
  cin >> n >> a >> b >> k;
  long long int h[n];
  for (long long int i = 0; i < n; i++) {
    cin >> h[i];
  }
  long long int ans = 0;
  vector<long long int> v;
  for (long long int i = 0; i < n; i++) {
    if (h[i] >= (a + b)) {
      long long int x = h[i] % (a + b);
      if (x == 0) {
        long long int z = ceil((b + 0.0) / a);
        v.push_back(z);
      } else if (x <= a) {
        ans++;
        continue;
      } else {
        v.push_back(ceil((x - a + 0.0) / a));
        continue;
      }
    } else if (h[i] <= a)
      ans++;
    else {
      long long int x = ceil((h[i] - a) / (a + 0.0));
      v.push_back(x);
    }
  }
  sort(v.begin(), v.end());
  long long int sum = 0, c = 0;
  for (long long int i = 0; i < v.size(); i++) {
    sum += v[i];
    if (sum <= k)
      c++;
    else
      break;
  }
  cout << ans + c << "\n";
}
int main() {
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
