#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
const long long INF = 1011111111;
const long long LLINF = 1000111000111000111LL;
const long double EPS = 1e-10;
const long double PI = 3.14159265358979323;
using namespace std;
long long powm(long long base, long long exp, long long mod = MOD) {
  long long ans = 1;
  while (exp) {
    if (exp & 1) ans = (ans * base) % mod;
    exp >>= 1, base = (base * base) % mod;
  }
  return ans;
}
const long long N = 1000005;
long long h[N];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  for (long long i = 1; i < n + 1; i++) cin >> h[i];
  long long ans = 0;
  vector<long long> v;
  for (long long i = 1; i < n + 1; i++) {
    long long tmp = h[i] % (a + b);
    if (tmp >= 1 and tmp <= a)
      ans++;
    else {
      if (tmp == 0) tmp = a + b;
      tmp -= a;
      v.push_back((tmp + a - 1) / a);
    }
  }
  sort((v).begin(), (v).end());
  long long sm = 0;
  for (auto i : v) {
    if (sm + i <= k) {
      ans++;
      sm += i;
    } else {
      break;
    }
  }
  cout << ans;
  return 0;
}
