#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, a, b, k, rem, i, ans, f, sum;
  cin >> n >> a >> b >> k;
  long long ar[n];
  for (i = 0; i < n; i++) {
    cin >> ar[i];
  }
  long long br[n];
  for (i = 0; i < n; i++) {
    rem = (ar[i] % (a + b));
    if (rem != 0) {
      if (rem <= a) {
        br[i] = 0;
      } else {
        br[i] = ceil((rem / (a * 1.0)));
        br[i] -= 1;
      }
    } else {
      ar[i] -= (a + b);
      br[i] = ceil(((a + b) / (a * 1.0)));
      br[i] -= 1;
    }
  }
  sort(br, br + n);
  sum = 0;
  f = 0;
  for (i = 0; i < n; i++) {
    sum += br[i];
    if (sum > k) {
      f = 1;
      ans = i;
      break;
    }
  }
  if (f == 1) {
    cout << ans << "\n";
  } else {
    cout << i << "\n";
  }
  return 0;
}
