Candy Boxes

A candy shop is selling special offers. Each special offer is a box containing several lion-shaped candies. There are $N$ special offers in total. The $i$-th special offer contains $m_i$ candies of sweetness $a_i$, and its price is $c_i$.

Jongyoung's blood sugar has dropped, so he wants to buy several special offers to fix that. For every $k$ from $1$ to $L$, find the minimum cost of buying offers so that he can eat candies whose sweetness sums to $k$. After buying a special offer, he does not have to eat every candy in it.

The first line gives $N$ and $L$, separated by a space. $(1 \le N, L \le 10\,000)$

Each of the next $N$ lines gives $a_i$, $m_i$, $c_i$, separated by spaces. $(1 \le a_i, m_i, c_i \le 10\,000)$

For every $k$ from $1$ to $L$, output in order the minimum cost of buying offers so that he can eat candies whose sweetness sums to $k$, separated by spaces. If no way exists for some $k$, output $-1$ instead.