NOT a SAT problem

A SAT problem asks whether you can assign true or false to the logical variables so that a given CNF evaluates to true.

• A CNF is one or more clauses joined by $\wedge$ (logical AND).
• A clause is one or more variables, or negated variables, joined by $\vee$ (logical OR).

For example, $(x_1\vee x_2\vee\neg x_3)$ and $(x_2\vee\neg x_4\vee\neg x_2\vee\neg x_4)$ are clauses. Joining them gives the CNF $(x_1\vee x_2\vee\neg x_3)\wedge(x_2\vee\neg x_4\vee\neg x_2\vee\neg x_4)$.

This problem is not a SAT problem. Instead of making the CNF true, you must make the CNF false.

The first line contains the number of variables $N$ and the number of clauses $M$ ($1 \le N \le 500000$, $1 \le M \le 200000$).

Each of the next $M$ lines describes one clause. The first integer $k$ is the number of literals in the clause ($1 \le k \le 200000$), followed by $k$ integers $a$. A positive $a$ means $x_a$ appears in the clause, and a negative $a$ means $\neg x_{|a|}$ appears in the clause ($1 \le |a| \le N$).

The sum of all $k$ is at most $500000$.

On the first line, print YES if you can make the CNF false, and NO otherwise.

If you can make the CNF false, print on the second line the values of $x_1, x_2, \ldots, x_N$ separated by spaces, where $1$ means true and $0$ means false. If several assignments work, print any one of them.