#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, x, cost[200010], ans;
int main() {
  cin >> n >> a >> b >> k;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    x = (x - 1) % (a + b);
    cost[i] = x / a;
  }
  sort(cost + 1, cost + n + 1);
  for (int i = 1; i <= n; i++) {
    k -= cost[i];
    if (k < 0) break;
    ans++;
  }
  cout << ans << endl;
  return 0;
}
