#include <bits/stdc++.h>
int main() {
  int n, a, b, k;
  std::cin >> n >> a >> b >> k;
  int input[n];
  for (int i = 0; i < n; i++) std::cin >> input[i];
  std::vector<int> dp(n);
  for (int i = 0; i < n; i++) {
    if ((input[i] - a) % (a + b) == 0 || (input[i] <= a)) {
      dp[i] = 0;
    } else {
      int x = (input[i] - a) / (a + b);
      int left = input[i] - ((a * (x + 1) + b * (x)));
      if (left > b) {
        dp[i] = 0;
        continue;
      }
      int p = left / a;
      if (left % a != 0) p++;
      dp[i] = p;
    }
  }
  std::sort(dp.begin(), dp.end());
  int points = 0;
  for (int i = 0; i < n && k > 0; i++) {
    if (dp[i] == 0)
      points++;
    else {
      k -= dp[i];
      if (k >= 0) points++;
    }
  }
  std::cout << points;
}
