Gems (GEM)

Seonhong keeps a flower bed in the front yard. The bed is a row of $N$ plots numbered 1 to $N$ from the left, and every plot holds between 0 and 100 gems.

One day Seonhong heard a rumor that gems might be buried in the bed and decided to check with a metal detector. Given two numbers $s$ and $e$, the detector sweeps plot $s$ through plot $e$ and reports the total number of gems buried in that range.

Seonhong swept the bed $M$ times and wrote down every result. Yeongmin walked by, tampered with the notes for fun, and left only the last digit of each result. Seonhong then told Yeongmin to recover the gem count of every plot from those digits alone. Help Yeongmin and find counts that do not contradict the notes.

The first line has the number of plots $N$ and the number of sweeps $M$, separated by a space. ($1 \le N \le 10^5$, $1 \le M \le 10^5$)

Each of the next $M$ lines has $s_i$, $e_i$ and $c_i$ separated by spaces. Sweep $i$ covered the range $[s_i, e_i]$, and the last digit of the total number of gems in that range was $c_i$. ($1 \le s_i \le e_i \le N$, $0 \le c_i \le 9$)

Print the gem count of plot 1 through plot $N$ on one line, separated by spaces. Every value must be an integer between 0 and 100, and all $M$ sweeps must come out right.

If several arrays satisfy the sweeps, print only the lexicographically smallest one. Array $a$ is lexicographically smaller than array $b$ when $a_i < b_i$ at the first position $i$ where the two arrays differ.

If the notes contradict each other and no array works, print -1 alone.