Difference Discipline

**Problem.** Line 1: n q. Then q lines: l r v (add v on [l, r]). Print the checksum: sum of final values mod 1e9+7. **Constraints:** 1 ≤ n, q ≤ 200000; |v| ≤ 10. The cancel point is r+1, not r.