#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, h, t;
    cin >> n >> h >> t;
    vector<int> a(n);
    cin >> a;
    
    vector<int> d(n);
    rep(i, n) d[i] = (h + a[i] - 1) / a[i];
    ll ng = 0, ok = h * ll(t);
    auto check = [&](ll x) {
        ll res = 0;
        rep(i, n) res += x / d[i];
        return res;
    };
    while(ng < ok-1) {
        ll m = (ng + ok) / 2;
        auto res = check(m);
        if(res < t) ng = m;
        else ok = m;
    }
    auto res = check(ok);
    vector<int> b(n), c(n);
    rep(i, n) {
        c[i] = ok / d[i];
        b[i] = ((ok-1) % d[i] + 1) * a[i];
    }

    priority_queue<pair<int, int>> pq;
    rep(i, n) if(b[i] >= h) pq.emplace(-b[i], i);
    rep(i, res - t) {
        auto[pi, pj] = pq.top(); pq.pop();
        c[pj]--;
    }
    cout << c << endl;
    return 0;
}