#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int N = 300007;
const int mod = 1e9 + 7;
const double eps = 1e-6;
long long T, n, m;
long long s[N];
long long ans;
signed main() {
  long long a, b, k;
  cin >> n >> a >> b >> k;
  for (long long i = (1); i <= (n); ++i)
    cin >> s[i], s[i] = ((s[i] - 1) % (a + b)) / a;
  sort(s + 1, s + n + 1);
  for (long long i = (1); i <= (n); ++i) {
    k -= s[i];
    if (k >= 0)
      ans++;
    else
      break;
  }
  cout << ans;
}
