#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
const long long MOD = (int)1e9 + 7;
const long long INF = MOD * MOD;
long long n, m, k, ans;
string s, t;
const long long powll = 1LL << 1;
int main(void) {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int h[n];
  for (int i = 0; i < n; i++) cin >> h[i];
  for (int i = 0; i < n; i++) {
    if (h[i] % (a + b) == 0)
      h[i] = a + b;
    else
      h[i] = h[i] % (a + b);
  }
  sort(h, h + n);
  int j = 0;
  while (a >= h[j] && j < n) j++;
  while (k > 0 && j < n) {
    if (h[j] % a == 0) {
      if (k >= h[j] / a - 1) {
        k -= h[j] / a - 1;
        j++;
      } else
        k = 0;
    } else {
      if (k >= h[j] / a) {
        k -= h[j] / a;
        j++;
      } else
        k = 0;
    }
  }
  cout << j << "\n";
}
