#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if ((arr[i] % (a + b)) == 0) {
      arr[i] = b;
    } else {
      arr[i] = arr[i] % (a + b);
      arr[i] = max((long long)0, arr[i] - a);
    }
  }
  sort(arr, arr + n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (arr[i] == 0) {
      ans++;
    } else {
      if (k >= ceil((double)arr[i] / a)) {
        k -= ceil((double)arr[i] / a);
        ans++;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
