#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;
}
 


int main(){
    ll n,h,t;cin >> n >> h >> t;
    vl a(n);
    rep(i,n)cin >> a[i];
    vl count(n);
    rep(i,n)count[i]=(h+a[i]-1)/a[i];
    priority_queue<tuple<ll,ll,ll>,vector<tuple<ll,ll,ll>>,greater<tuple<ll,ll,ll>>> que;
    ll now=0;
    rep(i,n){
        que.push({count[i],-count[i]*a[i],i});
    }
    vl ans(n);
    while(t--){
        auto [cnt,hoge,idx]=que.top();que.pop();
        now=cnt;
        ans[idx]++;
        que.push({count[idx]+now,-count[idx]*a[idx],idx});
    }
    rep(i,n)cout << ans[i] <<" ";cout << endl;

}