#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 1000000000000000001LL
using P = pair<int,int>;
P op(P a,P b){
	return min(a,b);
}
P e(){
	return {Inf32,Inf32};
}
P mapping(long long a,P b){
	b.first += a;
	return b;
}

long long composition(long long a,long long b){
	return a+b;
}
long long id(){
	return 0;
}
int main(){
	int N,H,T;
	cin>>N>>H>>T;
	vector<int> need(N);
	rep(i,N){
		cin>>need[i];
		need[i] = (H+need[i]-1)/need[i];
	}
	vector<int> ans(N);
	lazy_segtree<P,op,e,long long,mapping,composition,id> seg(N);
	rep(i,N)seg.set(i,{need[i],i});
	rep(_,T){
		auto res = seg.all_prod();
		ans[res.second]++;
		seg.apply(0,N,-res.first);
		seg.set(res.second,{need[res.second],res.second});
	}
	rep(i,N){
		if(i!=0)cout<<' ';
		cout<<ans[i];
	}
	cout<<endl;
	
	
	return 0;
}