Password Decryption

Junki invented a new rule for encrypting a sequence of $N$ ($1 \le N \le 2 \cdot 10^5$) numbers. Junki's encryption consists of $M$ ($1 \le M \le 2 \cdot 10^5$) clues.

The $i$-th clue consists of three values $L_i, R_i, XOR_i$ ($1 \le L_i \le R_i \le N$, $0 \le XOR_i \le 10^9$), which means that the bitwise XOR of the $L_i$-th through $R_i$-th numbers in Junki's sequence equals $XOR_i$.

Seungwon heard Junki's encryption rule and tried to find a way to recover $N$ numbers satisfying the given rule, but failed in the end. Help Seungwon by writing a program that, given Junki's encryption rule, outputs $N$ numbers satisfying the given rule.

The first line gives $N, M$ separated by a space ($1 \le N, M \le 2 \cdot 10^5$).

From the second line, $M$ lines follow, each giving $L_i, R_i, XOR_i$ ($1 \le L_i \le R_i \le N$, $0 \le XOR_i \le 10^9$) separated by spaces. This means that the bitwise XOR of the $L_i$-th through $R_i$-th numbers in the array equals $XOR_i$.

Print $N$ numbers separated by spaces that satisfy all $M$ given rules. The numbers making up the resulting array must be between $0$ and $2 \cdot 10^9$ inclusive. If multiple sequences satisfy the conditions, output any one of them. If no sequence satisfies all conditions, print $-1$.