Maximize a Fixed-Length Sum over Sparse Constant Segments

# Maximize a Fixed-Length Sum over Sparse Constant Segments Positive integer positions represent bags arranged from 1 to infinity. You are given non-overlapping closed segments. A segment `[left, right, value]` means every bag from `left` through `right` contains `value` units of money. Bags outside all segments contain zero. Choose exactly `k` consecutive bags and maximize their total money. Compute the maximum using the full integer values, then return that maximum modulo `1,000,000,007`. Implement: ```text calculateMaximumConsecutiveSum(k, segments) -> integer ``` Segments may be supplied in any order. They never intersect, and every value is positive. ## Constraints - `1 <= segments.length <= 200,000` - `1 <= k <= 10^9` - `1 <= left <= right <= 10^9` - `1 <= value <= 10^6` ## Examples ### Example 1 ```text k = 5 segments = [[1, 4, 2], [6, 6, 5], [7, 7, 7], [9, 10, 1]] output = 16 ``` The window from bag 3 through bag 7 contains `2 + 2 + 0 + 5 + 7 = 16`. ### Example 2 ```text k = 3 segments = [[5, 7, 4], [2, 2, 10]] output = 12 ``` The window from bag 5 through bag 7 contains 12, which is greater than any length-three window containing bag 2.