#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<long long int> s;
  long long int n, a, b, k, i, j, point = 0, p, q;
  cin >> n >> a >> b >> k;
  double m;
  p = a + b;
  long long int arr[n];
  for (i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (i = 0; i < n; i++) {
    if (arr[i] % p != 0) {
      j = arr[i] % p;
      if (j <= a) {
        point++;
      } else {
        j = (arr[i] - p * (arr[i] / p)) - a;
        q = ceil(1.0 * j / a);
        s.push_back(q);
      }
    } else if (arr[i] % p == 0) {
      j = (arr[i] - p * ((arr[i] / p) - 1)) - a;
      q = ceil(1.0 * j / a);
      s.push_back(q);
    }
  }
  sort(s.begin(), s.end());
  for (i = 0; i < s.size(); i++) {
    if (s[i] <= k) {
      point++;
      k -= s[i];
    }
  }
  cout << point << endl;
}
