#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
void DEBUG(string label, T value) {
  cerr << "[" << label << " = " << value << "]\n";
}
int n, a, b, k;
vector<int> arr, cost;
void solve() {
  cin >> n >> a >> b >> k;
  cost.resize(n);
  arr.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  for (int i = 0; i < n; ++i) {
    cost[i] = arr[i] % (a + b);
    bool added = 0;
    if (cost[i] == 0) {
      cost[i] += b;
      added = 1;
    }
    cost[i] = (cost[i] + a - 1) / a - 1 + added;
    assert(cost[i] >= 0);
  }
  sort(cost.begin(), cost.end());
  int i = 0;
  int s = 0;
  while (i < n && s + cost[i] <= k) {
    s += cost[i];
    i++;
  }
  cout << i << endl;
}
int main(int argv, char **argc) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
