#include <bits/stdc++.h>
using namespace std;
long long t, n, d[200007], a, b, k, r, l;
int main() {
  cin >> n >> a >> b >> k;
  for (int i = 1; i <= n; i++) {
    cin >> d[i];
    d[i] = (d[i] - 1) % (a + b) + 1;
  }
  sort(d + 1, d + 1 + n);
  for (int i = 1; i <= n; i++) {
    l = (d[i] / a);
    if (d[i] % a == 0) l--;
    if (k >= l && l >= 0) {
      k -= l;
      r++;
    }
  }
  cout << r;
  return 0;
}
