Perfume

The year is almost over. Christmas carols and small twinkling lights line the streets. Hope and relief show on people's faces, but some faces carry regret and anxiety as a faint shadow.

Jaemin is happy to see 2021 go, and tonight he has decided to give people happiness.

Tonight, $N$ people will spend their time walking along a road on an infinitely long vertical number line.

The $i$-th person starts walking in the positive direction from position $l_i$ and leaves the road at position $r_i$.

Jaemin has $K$ bottles of perfume. The perfume has a magical power that makes whoever smells it happy. The amount differs per person: the $i$-th of the $N$ people gains happiness $w_i$ when they smell it.

Jaemin wants to place the perfume bottles on the road so that the total happiness is maximized. However, because of the strong wind, a person can smell a bottle only if they pass exactly the position where it is placed. A person can smell a bottle at an endpoint of their path, and even if they smell several bottles, they gain happiness only once.

Help Jaemin give happiness to people and close out the year.

The first line contains $N$ and $K$, separated by a space. ($1 \le K \le N \le 200,000$)

Each of the next $N$ lines contains $l_i$, $r_i$, and $w_i$, separated by spaces. ($-10^9 \le l_i \le r_i \le 10^9$, $1 \le w_i \le 10,000$)

Print the maximum total happiness the people can gain when the $K$ bottles are placed optimally, on one line.