#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using triple = tuple<ll, int, int>;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, h, t; cin >> n >> h >> t;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    auto comp = [] (triple lhs, triple rhs) -> bool {
        auto [l1, l2, l3] = lhs;
        auto [r1, r2, r3] = rhs;
        if (l1 != r1) return l1 > r1;
        if (l2 != r2) return l2 < r2;
        return l3 > r2;
    };
    vector<int> ans(n, 0), res(n);
    for (int i = 0; i < n; i++) {
        res[i] = (h + a[i] - 1) / a[i];
    }
    priority_queue<triple, vector<triple>, decltype(comp)> que(comp);
    for (int i = 0; i < n; i++) {
        que.push({res[i], res[i] * a[i], i});
    }
    for (int i = 0; i < t; i++) {
        auto [ct, val, idx] = que.top(); que.pop();
        ans[idx]++;
        que.push({ct + res[idx], val, idx});
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i] << (i == n - 1 ? "\n" : " ");
    }
    return 0;
}