#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, a, b, k, j = 0, count = 0;
  cin >> n >> a >> b >> k;
  vector<long long> arr;
  for (long long i = 0; i <= n - 1; i++) {
    long long x;
    cin >> x;
    x = x % (a + b);
    if (x == 0) x = a + b;
    arr.push_back((x - 1) / a);
  }
  sort(arr.begin(), arr.end());
  while (k >= arr[j] && j < n) {
    count++;
    k -= arr[j];
    j++;
  }
  cout << count;
  return 0;
}
