Problem:
Score : 800 points

Problem Statement

There are N squares arranged in a row.
The squares are numbered 1, 2, ..., N, from left to right.

Snuke is painting each square in red, green or blue.
According to his aesthetic sense, the following M conditions must all be satisfied.
The i-th condition is:

There are exactly x_i different colors among squares l_i, l_i + 1, ..., r_i.

In how many ways can the squares be painted to satisfy all the conditions?
Find the count modulo 10^9+7.

Constraints

1 ≤ N ≤ 300

1 ≤ M ≤ 300

1 ≤ l_i ≤ r_i ≤ N

1 ≤ x_i ≤ 3

Input

Input is given from Standard Input in the following format:

N M
l_1 r_1 x_1
l_2 r_2 x_2
:
l_M r_M x_M

Output

Print the number of ways to paint the squares to satisfy all the conditions, modulo 10^9+7.

Sample Input 1

3 1
1 3 3

Sample Output 1

6

The six ways are:

RGB

RBG

GRB

GBR

BRG

BGR

where R, G and B correspond to red, green and blue squares, respectively.

Sample Input 2

4 2
1 3 1
2 4 2

Sample Output 2

6

The six ways are:

RRRG

RRRB

GGGR

GGGB

BBBR

BBBG

Sample Input 3

1 3
1 1 1
1 1 2
1 1 3

Sample Output 3

0

There are zero ways.

Sample Input 4

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

Sample Output 4

108

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

const MOD: usize = 1e9 as usize + 7;
fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());
    let n: usize = sc.read();
    let m: usize = sc.read();
    let mut constraints = vec![vec![]; n + 1];
    for _ in 0..m {
        let l: usize = sc.read();
        let r: usize = sc.read();
        let x: usize = sc.read();
        constraints[r].push((l, x));
    }

    let mut dp = vec![vec![vec![0; n + 1]; n + 1]; n + 1];
    dp[0][0][0] = 1;
    for pos in 1..(n + 1) {
        for x in 0..pos {
            for y in 0..pos {
                let next = [(x, y, pos - 1), (x, pos - 1, y), (pos - 1, x, y)];
                for (c, &(last_r, last_g, last_b)) in next.iter().enumerate() {
                    if x == 0 && y == 0 && pos == 1 && c >= 1 {
                        break;
                    }
                    if dp[last_r][last_g][last_b] == 0 {
                        continue;
                    }
                    if last_r > 0 && (last_r == last_g || last_r == last_b) {
                        continue;
                    }
                    if last_g > 0 && last_g == last_b {
                        continue;
                    }

                    for &(r, g, b) in [
                        (pos, last_g, last_b),
                        (last_r, pos, last_b),
                        (last_r, last_g, pos),
                    ]
                    .iter()
                    {
                        let mut ok = true;
                        for &(l, x) in constraints[pos].iter() {
                            let mut count = 0;
                            if l <= r {
                                count += 1;
                            }
                            if l <= g {
                                count += 1;
                            }
                            if l <= b {
                                count += 1;
                            }
                            if count != x {
                                ok = false;
                                break;
                            }
                        }

                        if ok {
                            dp[r][g][b] += dp[last_r][last_g][last_b];
                            if dp[r][g][b] >= MOD {
                                dp[r][g][b] -= MOD;
                            }
                        }
                    }
                }
            }
        }
    }

    let mut ans = 0;
    for r in 0..(n + 1) {
        for g in 0..(n + 1) {
            for b in 0..(n + 1) {
                if r == g || r == b || g == b {
                    continue;
                }
                if r != n && g != n && b != n {
                    continue;
                }
                ans += dp[r][g][b];
                if ans >= MOD {
                    ans -= MOD;
                }
            }
        }
    }

    println!("{}", ans);
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        IO(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}