#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int p = 0, i, n, k, b, ax, x;
  cin >> n >> ax >> b >> k;
  int a[n];
  for (i = 0; i < n; i++) {
    cin >> a[i];
    a[i] = a[i] % (ax + b);
    if (a[i] == 0) a[i] = ax + b;
  }
  sort(a, a + n);
  for (i = 0; i < n; i++) {
    x = a[i];
    if (x <= ax) {
      p++;
      continue;
    } else
      x -= ax;
    int q = ceil((x * 1.0) / ax);
    if (k >= q) {
      k -= q;
      p++;
    }
  }
  cout << p << "\n";
  return 0;
}
