A10654. Pokermon League challenge

The first line of the input contains two integer $n$ ( $4<=n<=50000$ ) and $e$ ( $2<=e<=100000$ ) — the total number of Pokermon trainers and the number of pairs of trainers who hate each other.

Pokermon trainers are numbered from $1$ to $n$ . Next $e$ lines contain two integers $a$ and $b$ ( $1<=a,b<=n$ ) indicating that Pokermon trainers $a$ and $b$ hate each other. Next $2n$ lines are in a following format. Starting with Pokermon trainer $1$ , for each trainer in consecutive order: first number $l_{i}$ ( $16<=l_{i}<=20$ ) — a size of Pokermon trainers wish list, then $l_{i}$ positive integers $t_{i,j}$ ( $1<=t_{i,j}<=T$ ), providing the teams the $i$ -th trainer would like to be on.

Each trainers wish list will contain each team no more than once. Teams on the wish lists are numbered in such a way that the set of all teams that appear on at least $1$ wish list is set of consecutive positive integers ${1,2,3,…,T}$ . Here $T$ might be up to $1000000$ .

Print two lines. The first line should contain $n$ numbers, specifying for each trainer the team he is in.

The second line should contain $T$ numbers, specifying the conference for each team ( $1$ or $2$ ).

无