#include <bits/stdc++.h>   using namespace std;   int main() {     long long int n, a, b, k;     cin >> n >> a >> b >> k;     long long int skips_left = k;     long long int win = 0;     long long int h[n];     long long int skips_req[n];     for (long long int m = 0; m < n; m++) {       skips_req[m] = 0;     }     for (long long int j = 0; j < n; j++) {       cin >> h[j];       long long int rem = (h[j] % (a + b));       if ((0 < rem) && (rem <= a)) {         skips_req[j] = 0;       } else if ((a < rem) && (rem < (a + b))) {         long long int skips;         if ((rem - a) % a == 0) {           skips_req[j] = (rem - a) / a;         } else {           skips = (rem - a) / a + 1;           skips_req[j] = skips;         }       } else if (rem == 0) {         long long int skips;         if ((b) % a == 0) {           skips_req[j] = b / a;         } else {           skips = (b / a) + 1;           skips_req[j] = skips;         }       }     }     sort(skips_req, skips_req + n);     long long int d;     d = 0;     while ((skips_left > 0) && (d < n)) {       skips_left = skips_left - skips_req[d];       if (skips_left >= 0) {         win++;       }       d++;     }     cout << win << endl;     return 0;   }   