Maximum coins from k consecutive bags

Bags stand at every positive integer position. Each segment [l, r, v] says every bag from l to r holds v; segments don't overlap and all other bags are empty. Choose k consecutive bags with the largest total and return it modulo 10^9 + 7. Work with the segments rather than with individual bags.