#include <bits/stdc++.h>
const long long INF = LLONG_MAX;
const long long RINF = LLONG_MIN;
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  deque<long long> monsters(n, 0);
  for (long long i = 0; i < n; ++i) {
    cin >> monsters[i];
  }
  long long ans = 0;
  for (long long i = 0; i < n; ++i) {
    monsters[i] = (monsters[i] - 1) % (a + b);
  }
  sort(monsters.begin(), monsters.end());
  while ((k || ans < n) && !monsters.empty()) {
    k -= monsters.front() / a;
    if (k < 0) break;
    ans++;
    monsters.pop_front();
  }
  cout << ans << endl;
  return 0;
}
