#include <iostream>
#include <cstdint>
#include <vector>
#include <algorithm>

static inline constexpr std::vector<uint_fast32_t> solve(const uint_fast32_t N, const uint_fast32_t H, const uint_fast32_t T, const std::vector<uint_fast32_t>& A) noexcept
{
	uint_fast64_t l = 0, r = 10'000'000'000'000;
	while (l + 1 < r)
	{
		const uint_fast64_t c = (l + r) / 2;
		uint_fast64_t count_operation = 0;
		for (uint_fast32_t i = 0; i != N; ++i)
			count_operation += c / ((H + A[i] - 1) / A[i]);

		if (count_operation >= T) r = c;
		else l = c;
	}

	std::vector<uint_fast32_t> ans(N, 0);
	uint_fast32_t count_operation = 0;
	for (uint_fast32_t i = 0; i != N; ++i)
		count_operation += (ans[i] = l / ((H + A[i] - 1) / A[i]));

	std::vector<std::pair<uint_fast64_t, uint_fast32_t>> rest(N);
	for (uint_fast32_t i = 0; i != N && count_operation < T; ++i)
		rest[i] = { ~(A[i] * static_cast<uint_fast64_t>(l % ((H + A[i] - 1) / A[i]) + 1)), i };

	std::sort(rest.begin(), rest.end());
	for (uint_fast32_t i = 0; i != T - count_operation; ++i)
		++ans[rest[i].second];

	return ans;
}

static inline void output(const uint_fast32_t N, const std::vector<uint_fast32_t>& ans) noexcept
{
	std::cout << ans[0];
	for (uint_fast32_t i = 1; i != N; ++i)
		std::cout << ' ' << ans[i];
	std::cout << '\n';
}

int main()
{
	std::cin.tie(nullptr);
	std::ios::sync_with_stdio(false);
	
	uint_fast32_t N, H, T, i;
	std::cin >> N >> H >> T;
	std::vector<uint_fast32_t> A(N);
	for (i = 0; i != N; ++i)
		std::cin >> A[i];

	output(N, solve(N, H, T, A));
	return 0;
}