#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  bool turn = true;
  int power = a + b;
  vector<int> monsters;
  int res = 0;
  for (int i = 0; i < n; i++) {
    double temp;
    cin >> temp;
    double org = temp;
    temp = ((int)temp) % (a + b);
    if (temp > 0 && temp <= a) {
      res++;
    } else {
      if (temp == 0 && org >= a + b) {
        monsters.push_back((ceil((double)b / (double)a)));
      } else if (temp > 0) {
        monsters.push_back(ceil((temp - a) / a));
      } else {
        res++;
      }
    }
  }
  sort(monsters.begin(), monsters.end());
  for (int i = 0; i < monsters.size(); i++) {
    if (monsters[i] <= k) {
      k -= monsters[i];
      res++;
    } else {
      break;
    }
  }
  cout << res << endl;
}
int main() {
  int t;
  solve();
  return 0;
}
