#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    long long int n, a, b, k, ans = 0, d;
    cin >> n >> a >> b >> k;
    long long int m[n];
    vector<long long int> vec;
    for (long long int i = 0; i < n; i++) {
      cin >> m[i];
      if (m[i] % (a + b) != 0) {
        if ((m[i] % (a + b)) <= a)
          ans++;
        else {
          d = (m[i] % (a + b)) - a;
          vec.push_back(ceil((double)d / a));
        }
      } else {
        vec.push_back(ceil((double)b / a));
      }
    }
    sort(vec.begin(), vec.end());
    for (long long int i = 0; i < vec.size(); i++) {
      if (k >= vec[i]) {
        k = k - vec[i];
        ans++;
      } else
        break;
    }
    cout << ans;
  }
}
