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