#include <bits/stdc++.h>
using namespace std;
#include <atcoder/segtree>

#define int long long

int N;
vector<int> B;

int op(int a, int b) {
	if (B[a] <= B[b]) return a;
	return b;
}

int e() { return N; }

main() {
	int H, T; cin >> N >> H >> T;
	vector<int> A(N);
	for (int i = 0; i < N; i++) cin >> A[i];
	
	vector<int> R(N+1);
	for (int i = 0; i < N; i++) {
		R[i] = (H + A[i] - 1) / A[i];
	}
	R[N] = 1e9;
	
	B = R;
	
	vector<int> P(N); iota(P.begin(), P.end(), 0);
	atcoder::segtree<int, op, e> seg(P);
	int all = 0;
	vector<int> C(N, 0);
	
	for (int i = 0; i < T; i++) {
		int id = seg.all_prod();
		C[id]++;
		int cnt = max(0LL, B[id] - all);
		all += cnt;
		B[id] = R[id] + all;
		seg.set(id, id);
	}
	
	for (int i = 0; i < N; i++) cout << C[i] << " ";
	cout << endl;
}