#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, a, b, k, temp;
  scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
  long long int arr[n], points = 0;
  vector<long long int> v;
  for (int i = 0; i < n; i++) scanf("%lld", &arr[i]);
  for (int i = 0; i < n; i++) {
    temp = arr[i] % (a + b);
    if (temp != 0 && temp <= a)
      points++;
    else if (temp == 0) {
      temp = ceil((double)b / (double)a);
      v.push_back(temp);
    } else {
      temp = ceil((double)(temp - a) / (double)a);
      v.push_back(temp);
    }
  }
  sort(v.begin(), v.end());
  long long int total = 0;
  for (int i = 0; i < v.size(); i++) {
    if ((total + v[i]) <= k) {
      points++;
      total += v[i];
    } else
      break;
  }
  printf("%lld\n", points);
}
