#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
const int mod = 1e9 + 7;
using namespace std;
const int maxn = 2e5 + 7;
int s[maxn];
int main() {
  int n, a, b, k;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  for (int i = 1, p; i <= n; ++i) {
    scanf("%d", &p);
    p = (p - 1) % (a + b) + 1;
    s[i] = p / a;
    if (p % a == 0) s[i]--;
  }
  sort(s + 1, s + 1 + n);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (s[i] <= k) {
      k -= s[i];
      ans++;
    }
  }
  printf("%d", ans);
  return 0;
}
