#include <bits/stdc++.h>
using namespace std;
string dc(int a, int b) {
  cout << " (" << a << "," << b << ")-> ";
  string s = "";
  return s;
}
void Hanji() { cout << "YES" << endl; }
void Naaji() { cout << "NO" << endl; }
bool comp(pair<int, int> l, pair<int, int> r) {
  if (l.first == r.first) return l.second < r.second;
  return l.first < r.first;
}
bool inGrid(int i, int j, int n, int m) {
  if (i < 0 || j < 0 || i >= n || j >= m) return false;
  return true;
}
int digsum(long long unsigned num) {
  int sum = 0;
  while (num > 0) {
    sum += num % 10;
    num /= 10;
  }
  return sum;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long int n, a, b, k;
  cin >> n >> a >> b >> k;
  vector<long long int> arr(n, 0);
  vector<long long int> t(n, 0);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (arr[i] % (a + b) >= 1 && arr[i] % (a + b) <= a)
      t[i] = 0;
    else if (arr[i] % (a + b) == 0) {
      t[i] = b / a;
      if (b % a != 0) t[i]++;
    } else {
      int h = arr[i] % (a + b);
      h -= a;
      t[i] = h / a;
      if (h % a != 0) t[i]++;
    }
  }
  sort(t.begin(), t.end());
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (t[i] == 0)
      ans++;
    else {
      k -= t[i];
      if (k >= 0) ans++;
    }
  }
  cout << ans;
  return 0;
}
