#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, h, t; cin >> n >> h >> t;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	vector<long long>s(n), o(n);
	rep(i, n) {
		s[i] = (h + a[i] - 1) / a[i];
		o[i] = s[i] * a[i] - h;
	}

	priority_queue<tuple<long long, long long, int>, vector<tuple<long long, long long, int>>, greater<>> pq;
	rep(i, n) {
		pq.emplace(s[i], -o[i], i);
	}
	vector<int>ans(n);
	rep(_t, t) {
		auto[t, _, i] = pq.top();
		pq.pop();
		ans[i]++;
		pq.emplace(t + s[i], -o[i], i);
	}
	rep(i, n)cout << ans[i] << " ";
	cout << endl;
	return 0;
}