#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int ar[n];
  vector<int> h;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> ar[i];
    if (ar[i] <= a) {
      ans++;
    } else if (ar[i] % (a + b) != 0) {
      if ((ar[i] % (a + b)) <= a) {
        ans++;
      } else {
        int temp = (ar[i] % (a + b));
        temp -= a;
        h.push_back(temp);
      }
    } else if (ar[i] % (a + b) == 0) {
      h.push_back(b);
    }
  }
  vector<int>::iterator it;
  sort(h.begin(), h.end());
  for (it = h.begin(); it < h.end(); it++) {
    if (*it <= a) {
      if (k - 1 >= 0) {
        k--;
        ans++;
      } else {
        break;
      }
    } else if (*it > a) {
      int tmp = *it;
      int kt = tmp / a;
      if (tmp % a != 0) kt++;
      if (k - kt >= 0) {
        ans++;
        k -= kt;
      } else {
        break;
      }
    }
    if (k <= 0) break;
  }
  cout << ans << endl;
}
