#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, a, b, k;
  cin >> n >> a >> b >> k;
  long long int h[n], plus = 0, ans = 0;
  vector<long long int> v;
  for (long long int i = 0; i < n; i++) {
    cin >> h[i];
    h[i] = h[i] % (a + b);
    if (h[i] == 0)
      v.push_back(ceil(b / (a * 1.0)));
    else if (h[i] <= a)
      ans++;
    else
      v.push_back(ceil((h[i] - a) / (a * 1.0)));
  }
  sort(v.begin(), v.end());
  for (long long int i = 0; i < v.size(); i++) {
    if (k >= v[i])
      k -= v[i], ans++;
    else
      break;
  }
  cout << ans << endl;
  return 0;
}
