#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 1e6;
void solve() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long score = 0;
  vector<long long> monsters(min(a + b + 1, (long long)5000005), 0);
  for (long long i = 0; i < n; i++) {
    long long h;
    cin >> h;
    long long left = (h % (a + b));
    if (left == 0) {
      left += (a + b);
    }
    if (left > a) {
      left -= a;
      if ((left + a - 1) / a <= 5000000) {
        monsters[(left + a - 1) / a]++;
      }
    } else {
      score++;
    }
  }
  for (long long i = 1; i <= monsters.size(); i++) {
    while (monsters[i] && k >= i && score != n) {
      monsters[i]--;
      score++;
      k -= i;
    }
  }
  cout << score;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
}
