#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int m[N];
int main(void) {
  int n, a, b, k;
  scanf("%d %d %d %d", &n, &a, &b, &k);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &m[i]);
    m[i] = m[i] % (a + b);
    if (m[i] == 0) {
      m[i] = a + b;
    }
  }
  sort(m + 1, m + 1 + n);
  for (int i = 1; i <= n; i++) {
    int need = m[i] / a;
    if (m[i] % a) need++;
    if (need > 1) {
      k -= need - 1;
    }
    if (k >= 0) {
      ans++;
    } else
      break;
  }
  printf("%d\n", ans);
}
