#include <bits/stdc++.h>
using namespace std;
void vout(vector<long long> ans) {
  for (auto ele : ans) cout << ele << " ";
  cout << "\n";
}
vector<long long> adj[200001];
bool vis[200001];
clock_t time_p = clock();
void purvansh11() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
long long power(long long a, long long b) {
  long long ans = 1;
  long long num = a;
  while (b > 0) {
    if (b & 1) ans = ((ans % 1000000007) * (num % 1000000007)) % 1000000007;
    num = ((num % 1000000007) * (num % 1000000007)) % 1000000007;
    b /= 2;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(8);
  cout << fixed;
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  vector<long long> v(n);
  long long cnt = 0;
  multiset<long long> s;
  for (auto &itr : v) cin >> itr;
  for (auto ele : v) {
    if (ele <= a) {
      cnt++;
      continue;
    }
    long long n1 = ceil(((ele - a) / ((double)(a + b))));
    if ((ele > (n1 * (a + b))) and (ele <= ((n1 * (a + b)) + a)))
      cnt++;
    else {
      long long calc = 0;
      long long n2 = floor(((ele + b) / (double)(a + b)));
      long long diff = ele - ((n2 * (a + b)) - b);
      calc = ceil(diff / (double(a)));
      s.insert(calc);
    }
  }
  for (auto ele : s) {
    if (k - ele >= 0)
      k -= ele, cnt++;
    else
      break;
  }
  cout << cnt;
  purvansh11();
  return 0;
}
