#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#define dbgn(...) 0
#endif

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    ll n, h, t;
    cin >> n >> h >> t;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<ll> c(n, 0);
    vector<ll> lst(n, 0);
    set<pair<ll, int>> pq;
    for (int i = 0; i < n; i++) {
        pq.insert({(h + a[i] - 1) / a[i], i});
    }
    while (t > 0 && !pq.empty()) {
        ll nxt = pq.begin()->first;
        set<pair<ll, int>> curr;

        while (!pq.empty() && pq.begin()->first == nxt) {
            int idx = pq.begin()->second;
            pq.erase(pq.begin());
            curr.insert({-(nxt - lst[idx]) * a[idx], idx});
        }
        for (auto x : curr) {
            if (t == 0) {
                break;
            }
            int idx = x.second;
            c[idx]++;
            t--;
            lst[idx] = nxt;
            pq.insert({nxt + (h + a[idx] - 1) / a[idx], idx});
        }
    }
    for (int i = 0; i < n; i++) {
        cout << c[i] << ' ';
    }
    cout << '\n';
    return 0;
}