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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, h, t;
    cin >> n >> h >> t;
    vector<ll> a(n);
    vector<int> c(n);
    // 何回足す,オフセット,添え字
    priority_queue<tuple<ll,ll,int>> pq;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        ll d = (h + a[i] - 1) / a[i];
        pq.emplace(-d, d * a[i], -i);
    }
    while(t--){
        auto [cnt, d, idx] = pq.top();
        idx *= -1;
        pq.pop();
        c[idx]++;
        ll add = (h + a[idx] - 1) / a[idx];
        cnt -= add;
        pq.emplace(cnt, a[idx] * add, -idx);
    }
    for(int i = 0; i < n; i++) cout << c[i] << (i + 1 == n ? '\n' : ' ');
}