#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
int n, a, b, k;
int h[N], ans = 0;
vector<int> v;
int main() {
  cin >> n >> a >> b >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> h[i];
    int rest = h[i] % (a + b);
    if (rest == 0) rest = a + b;
    if (rest <= a)
      ++ans;
    else {
      rest -= a;
      int x = rest / a + (rest % a != 0);
      v.push_back(x);
    }
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size(); ++i) {
    if (k >= v[i])
      k -= v[i], ++ans;
    else
      break;
  }
  cout << ans << endl;
  return 0;
}
