N, H, T = map(int, input().split())
A = list(map(int, input().split()))

def func(n):
    cnt = 0
    for a in A:
        cnt += n//((H+a-1)//a)
        if T <= cnt:
            return False
    return True

left = 0
right = 10**18
while left+1 < right:
    mid = (left+right)//2
    if func(mid):
        left = mid
    else:
        right = mid

cnt = left
B = []
C = []
for a in A:
    C.append(cnt//((H+a-1)//a))
    B.append(a*(cnt%((H+a-1)//a)))

r = T-sum(C)
for i in range(N):
    B[i] += A[i]
D = sorted([(b, i) for i, b in enumerate(B)], key=lambda x:(-x[0], x[1]))[:r]
for b, idx in D:
    C[idx] += 1

print(*C)