#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int h[n];
  for (int i = 0; i < n; i++) cin >> h[i];
  int c = 0;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    if (h[i] % (a + b) == 0 || h[i] % (a + b) > a)
      v.push_back(h[i]);
    else
      c++;
  }
  vector<int> ans;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] % (a + b) == 0) {
      ans.push_back(b / a + ((b % a) != 0));
    } else {
      int r = v[i] % (a + b);
      r -= a;
      ans.push_back(r / a + ((r % a) != 0));
    }
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i] > k) break;
    k = k - ans[i];
    c++;
  }
  cout << c;
}
