#include <bits/stdc++.h>
using namespace std;
long long mulmod(long long a, long long b, long long c) {
  if (b == 0) return 0;
  long long s = mulmod(a, b / 2, c);
  if (b % 2 == 1)
    return (a % c + 2 * (s % c)) % c;
  else
    return (2 * (s % c)) % c;
}
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int main() {
  long long int t;
  t = 1;
  while (t--) {
    long long int n, a, b, k, i, j;
    cin >> n >> a >> b >> k;
    long long int h[n], ar[n], count = 0, temp;
    for (i = 0; i < n; i++) {
      cin >> h[i];
      temp = h[i] % (a + b);
      if (temp == 0) {
        ar[i] = b / (a);
        if (b % (a) != 0) ar[i]++;
      } else if (temp <= a) {
        ar[i] = 0;
      } else {
        temp -= a;
        if (temp > 0) {
          ar[i] = temp / (a);
          if (temp % (a) != 0) ar[i]++;
        }
      }
    }
    sort(ar, ar + n);
    for (i = 0; i < n; i++) {
      k -= ar[i];
      if (k < 0)
        break;
      else
        count++;
    }
    cout << count << endl;
  }
  return 0;
}
