#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 19;
int arr[maxn];
int main() {
  int n, a, b, k, h, m = 0, x = 0;
  cin >> n >> a >> b >> k;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> h;
    x = h % (a + b);
    if (x == 0) {
      x = a + b;
    }
    if (x > 0 && x <= a) {
      ans++;
    } else {
      if (x % a == 0) {
        arr[m++] = (x / a) - 1;
      } else {
        arr[m++] = (x / a);
      }
    }
  }
  sort(arr, arr + m);
  for (int i = 0; i < m; i++) {
    if (k >= arr[i]) {
      k -= arr[i];
      ans++;
    }
  }
  cout << ans << endl;
}
