#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, h, t;
  cin >> n >> h >> t;
  VI a(n);
  rep(i, n) cin >> a[i];
  VL c(n), r(n);
  auto f = [&](ll cnt) -> bool {
    ll sm = 0;
    rep(i, n) {
      int req = (h + a[i] - 1) / a[i];
      c[i] = cnt / req;
      r[i] = cnt % req * a[i];
    }
    return accumulate(all(c), 0LL) <= t;
  };
  ll lb = 0, ub = 1;
  while (f(ub)) lb = ub, ub *= 2;
  while (ub - lb > 1) {
    ll c = (lb + ub) / 2;
    (f(c) ? lb : ub) = c;
  }
  f(lb);
  int rest = t - accumulate(all(c), 0);
  assert(rest < n);
  vector<P> d(n);
  rep(i, n) {
    d[i] = {-(a[i] + r[i]), i};
  }
  sort(all(d));
  rep(i, rest) c[d[i].second]++;
  rep(i, n) cout << c[i] << " \n"[i + 1 == n];
}