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