#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a, b, k, p[N];
int main() {
  cin >> n >> a >> b >> k;
  int sum = a + b;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    if (p[i] % sum == 0)
      p[i] = sum;
    else
      p[i] %= sum;
    p[i] -= a;
  }
  int ans = 0;
  sort(p + 1, p + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (p[i] <= 0)
      ans++;
    else {
      int t = ceil(p[i] * 1.0 / a);
      if (t <= k) k -= t, ans++;
    }
  }
  cout << ans;
  return 0;
}
