#include <bits/stdc++.h>
using namespace std;
long long int ar[500009], br[500009];
int main() {
  long long int a, b, c, i, j, k, f, g, h, x, y, z;
  long long int n;
  cin >> n >> a >> b >> c;
  k = 0;
  long long int m = 0;
  long long int cnt = 0;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
    k = ar[i] % (a + b);
    if (k >= 1 && k <= a)
      cnt++;
    else if (k != 0)
      br[++m] = k - a;
    else
      br[++m] = b;
  }
  sort(br + 1, br + m + 1);
  for (i = 1; i <= m; i++) {
    if (br[i] % a == 0)
      k = br[i] / a;
    else
      k = br[i] / a + 1;
    if (c >= k) {
      c -= k;
      cnt++;
    } else
      break;
  }
  cout << cnt << endl;
}
