#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

int main(){
	int N,H,T;
	cin>>N>>H>>T;
	vector<long long> a(N);
	rep(i,N)cin>>a[i];
	
	long long ok = 0,ng = 100000000000000LL;
	while(ng-ok>1LL){
		long long mid = (ok+ng)/2;
		long long sum = 0;
		rep(i,N){
			long long t = (H+a[i]-1)/a[i];
			sum += mid / t;
			sum = min(sum,(long long)T+1);
		}
		if(sum > T)ng = mid;
		else ok = mid;
	}
	vector<long long> ans(N);
	vector<pair<long long,int>> b;
	rep(i,N){
		long long t = (H+a[i]-1)/a[i];
		ans[i] += ok / t;
		long long rem = ok % t;
		rem++;
		b.emplace_back(rem * a[i],i);
		T -= ans[i];
	}
	sort(b.rbegin(),b.rend());
	rep(i,T)ans[b[i].second]++;
	rep(i,N){
		if(i!=0)cout<<' ';cout<<ans[i];
	}
	cout<<endl;
	return 0;
}