#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 

 //https://atcoder.jp/contests/maximum-cup-2023/submissions/44926430
vector<tuple<ll,ll,ll>> quotient_ceils(ll n){
    //ceil(n/i)=xを満たすx,i∈[l,r)をこの順に返す。lの昇順、つまりxの降順なことに注意。
    vector<tuple<ll,ll,ll>> ret;
    for(ll l=1;l<=n;){
        ll x=(n+l-1)/l;
        ll r=(x==1? n+1:(n+x-2)/(x-1));
        ret.emplace_back(x,l,r);
        l=r;
    }
    return ret;
}

int main(){
    ll n,h,t;cin >> n >> h >> t;
    auto v=quotient_ceils(h);
    /*for(auto [x,l,r]:v){
        cout << x <<" " << l <<" " << r << endl;
    }*/
    ll m=v.size();
    vvl g(m);
    vl a(n);
    rep(i,n)cin >> a[i];
    rep(i,n){
        rep(j,m){
            auto [x,l,r]=v[j];
            if(l<=a[i]&&a[i]<r){
                g[j].emplace_back(i);
            }
        }
    }
    vl counter(m,INF);
    vl upps(m);
    rep(i,m){
        auto [x,l,r]=v[i];
        upps[i]=x;
        if(g[i].size())counter[i]=x;
    }
    vl ans(n);
    //for(auto p:counter)cout << p <<" ";cout << endl;
    while(t){
        ll mx=*min_element(all(counter));
        rep(i,m)counter[i]-=mx;
        vpl cal;
        rep(i,m){
            if(counter[i]==0){
                for(auto p:g[i]){
                    cal.push_back({(h+a[p]-1)/a[p]*-(a[p]),p});
                }
                counter[i]=upps[i];
            }
        }
        if(t<cal.size())sort(all(cal));
        for(auto [val,p]:cal){
            ans[p]++;
            t--;
            if(t==0)break;
        }
    }
    rep(i,n)cout << ans[i] <<" ";cout << endl;
}