Problem:
Score : 100 points

Problem Statement

Consider a string of length N consisting of 0 and 1.
The score for the string is calculated as follows:

For each i (1 \leq i \leq M), a_i is added to the score if the string contains 1 at least once between the l_i-th and r_i-th characters (inclusive).

Find the maximum possible score of a string.

Constraints

All values in input are integers.

1 \leq N \leq 2 × 10^5

1 \leq M \leq 2 × 10^5

1 \leq l_i \leq r_i \leq N

|a_i| \leq 10^9

Input

Input is given from Standard Input in the following format:

N M
l_1 r_1 a_1
l_2 r_2 a_2
:
l_M r_M a_M

Output

Print the maximum possible score of a string.

Sample Input 1

5 3
1 3 10
2 4 -10
3 5 10

Sample Output 1

20

The score for 10001 is a_1 + a_3 = 10 + 10 = 20.

Sample Input 2

3 4
1 3 100
1 1 -10
2 2 -20
3 3 -30

Sample Output 2

90

The score for 100 is a_1 + a_2 = 100 + (-10) = 90.

Sample Input 3

1 1
1 1 -10

Sample Output 3

0

The score for 0 is 0.

Sample Input 4

1 5
1 1 1000000000
1 1 1000000000
1 1 1000000000
1 1 1000000000
1 1 1000000000

Sample Output 4

5000000000

The answer may not fit into a 32-bit integer type.

Sample Input 5

6 8
5 5 3
1 1 10
1 6 -8
3 6 5
3 4 9
5 5 -2
1 3 -6
4 6 -7

Sample Output 5

10

For example, the score for 101000 is a_2 + a_3 + a_4 + a_5 + a_7 = 10 + (-8) + 5 + 9 + (-6) = 10.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

use std::collections::HashMap;

fn main() {
    input!{
        n: usize,
        m: usize,
        v: [(usize, usize, i64); m]
    }
    let mut map: HashMap<usize, Vec<(usize, i64)>> = HashMap::new();
    for (l, r, a) in v {
        map.entry(r).or_insert(Vec::new()).push((l, a));
    }
    let mut seg: LSegT = LSegT::new(n + 1);
    for i in 1..n + 1 {
        let m = seg.max(0, i - 1);
        seg.add(i, i, m);
        if let Some(x) = map.get(&i) {
            for &(l, a) in x {
                seg.add(l, i, a);
            }
        }
    }
    println!("{}", seg.max(0, n));
}

#[derive(Debug)]
struct LSegT {
    v: Vec<i64>,
    lazy: Vec<i64>,
    n: usize
}

impl LSegT {
    fn new(n: usize) -> LSegT {
        let mut s = 1;
        while s < n {
            s *= 2;
        }
        LSegT{v: vec![0; 2 * s - 1], lazy: vec![0; 2 * s - 1], n: s}
    }

    fn eval(&mut self, p: usize) {
        if self.lazy[p] == 0 {
            return;
        }
        self.v[p] += self.lazy[p];
        if p < self.n - 1 {
            self.lazy[2 * p + 1] += self.lazy[p];
            self.lazy[2 * p + 2] += self.lazy[p];
        }
        self.lazy[p] = 0;
    }

    fn add(&mut self, l: usize, r: usize, x: i64) {
        let n = self.n;
        self.add_rec(l, r, x, 0, 0, n - 1);
    }

    fn add_rec(&mut self, l: usize, r: usize, x: i64, p: usize, pl: usize, pr: usize) {
        if pl > r || pr < l {
            return;
        } else if l <= pl && pr <= r {
            self.lazy[p] += x;
            self.eval(p);
        } else {
            self.eval(p);
            self.add_rec(l, r, x, 2 * p + 1, pl, (pl + pr - 1) / 2);
            self.add_rec(l, r, x, 2 * p + 2, (pl + pr + 1) / 2, pr);
            self.v[p] = std::cmp::max(self.v[2 * p + 1], self.v[2 * p + 2]);
        }
    }

    fn max(&mut self, l: usize, r: usize) -> i64 {
        let n = self.n;
        self.max_rec(l, r, 0, 0, n - 1)
    }

    fn max_rec(&mut self, l: usize, r: usize, p: usize, pl: usize, pr: usize) -> i64 {
        self.eval(p);
        if pl > r || pr < l {
            i64::min_value()
        } else if l <= pl && pr <= r {
            self.v[p]
        } else {
            let a = self.max_rec(l, r, 2 * p + 1, pl, (pl + pr - 1) / 2);
            let b = self.max_rec(l, r, 2 * p + 2, (pl + pr + 1) / 2, pr);
            // self.v[p] = std::cmp::max(self.v[2 * p + 1], self.v[2 * p + 2]);
            std::cmp::max(a, b)
        }
    }
}