Maximum Money From K Consecutive Bags

Bags are indexed from 1 to infinity, and every bag initially contains 0 money.

You are given n non-overlapping inclusive segments. segments[i] = [l, r, v] means that every bag whose index is ...