A9764 | Interesting Array

We'll call an array of $n$ non-negative integers $a\[1\],a\[2\],...,a\[n\]$ interesting, if it meets $m$ constraints. The $i$ -th of the $m$ constraints consists of three integers $l_{i}$ , $r_{i}$ , $q_{i}$ ( $1<=l_{i}<=r_{i}<=n$ ) meaning that value  should be equal to $q_{i}$ .

Your task is to find any interesting array of $n$ elements or state that such array doesn't exist.

Expression $x&y$ means the bitwise AND of numbers $x$ and $y$ . In programming languages C++, Java and Python this operation is represented as "&", in Pascal — as "and".

We'll call an array of $n$ non-negative integers $a\[1\],a\[2\],...,a\[n\]$ interesting, if it meets $m$ constraints. The $i$ -th of the $m$ constraints consists of three integers $l_{i}$ , $r_{i}$ , $q_{i}$ ( $1<=l_{i}<=r_{i}<=n$ ) meaning that value  should be equal to $q_{i}$ .

Your task is to find any interesting array of $n$ elements or state that such array doesn't exist.

Expression $x&y$ means the bitwise AND of numbers $x$ and $y$ . In programming languages C++, Java and Python this operation is represented as "&", in Pascal — as "and".

We'll call an array of $n$ non-negative integers $a\[1\],a\[2\],...,a\[n\]$ interesting, if it meets $m$ constraints. The $i$ -th of the $m$ constraints consists of three integers $l_{i}$ , $r_{i}$ , $q_{i}$ ( $1<=l_{i}<=r_{i}<=n$ ) meaning that value  should be equal to $q_{i}$ .

Your task is to find any interesting array of $n$ elements or state that such array doesn't exist.

Expression $x&y$ means the bitwise AND of numbers $x$ and $y$ . In programming languages C++, Java and Python this operation is represented as "&", in Pascal — as "and".