Problem Statement

You are given a sequence $A=(A_1, A_2, \cdots, A_N)$ of length $N$.

There are also sequences $B=(B_1, B_2, \cdots, B_N), C=(C_1, C_2, \cdots, C_N)$ of length $N$, and initially all elements of $B, C$ are $0$. Consider the following operation on these sequences.

Operation:

• As long as the maximum value of $B$ is less than $H$, repeat the following:
  • For every $i$ satisfying $1\leq i\leq N$, set $B_i\leftarrow B_i+A_i$.
• Then, letting $M$ be the maximum value of $B$, for the smallest $i$ satisfying $B_i=M\ (1\leq i\leq N)$, set $B_i\leftarrow 0$ and $C_i\leftarrow C_i+1$.

Find each value of $C$ after performing the operation exactly $T$ times in succession.

Input

$N$ $H$ $T$
$A_1\ A_2\ \cdots\ A_N$

• $1\leq N\leq 10^5$
• $1\leq H\leq 10^8$
• $1\leq T\leq 10^5$
• $1\leq A_i\lt H$
• All inputs are integers.

Output

Print $C$ after exactly the $T$-th operation has finished, on $1$ line in the following format.

$C_1\ C_2\ \cdots\ C_N$

Print a newline at the end.

Sample

2 8 7
2 3

3 4