Problem Statement

Takahashi explores a cave consisting of N rooms. The rooms are numbered from 1 to N. There are M one-way passages between rooms. Each passage has a fixed direction from one room to another.

For each room, the passages leading out of it have a defined priority order. This priority corresponds to the order given in the input, with passages given earlier having higher priority.

Additionally, each room has a light installed, and the color of the light is either red (0) or blue (1).

Takahashi starts exploring from room 1. Room 1 is marked as visited at the start of the exploration. The exploration follows these rules:

1. Check all passages leading out of the current room one by one in order of decreasing priority. For each passage, if the room at the end of the passage has already been visited, skip that passage and move on to the next one. If the room at the end of the passage is unvisited, proceed to step 2.
2. If the light color of the confirmed unvisited room is the same as the light color of the current room, do not move to that room, skip that passage, and continue checking the next passage. This room does not become visited, and it may be checked again on a different occasion in the future.
3. If the light color of the confirmed unvisited room is different from the light color of the current room, move to that room and mark it as visited. Set the destination room as the new "current room" and restart from step 1.
4. If all passages from the current room have been checked and no destination was found (all were visited or skipped in step 2), or if there are no passages leading out of the current room, perform a backtrack. That is, regardless of passage directions, return to the room you were in immediately before moving to the current room. Set that room as the "current room" and resume checking passages from where it was interrupted, starting from the next passage after the interruption point, continuing the process of steps 1–3.
5. If a backtrack occurs at room 1 (that is, no destination is found from room 1 and there is no room to return to), the exploration ends.

Here, "resuming the interrupted passage check" specifically means the following: Suppose while checking passages in priority order from some room X, you moved to another room Y via step 3. After that (following exploration from room Y onward and backtracks), when you return to room X, you resume checking from the passage with the next priority after the passage to room Y. After resuming, whether each passage's destination room has been visited is judged based on the state at that point in time.

When the exploration ends, output all room numbers that were never visited in ascending order. If all rooms were visited, output COMPLETE.

Constraints

• 1 \leq N \leq 2 \times 10^5
• 0 \leq M \leq 2 \times 10^5
• C_i \in \{0, 1\} (1 \leq i \leq N)
• 1 \leq U_j, V_j \leq N (1 \leq j \leq M)
• U_j \neq V_j (1 \leq j \leq M)
• The same pair (U_j, V_j) is not given more than once
• The graph is not necessarily connected
• All input values are integers

Sample Input 1

5 5
0 1 0 1 0
1 2
2 3
3 4
4 5
1 5

Sample Output 1

COMPLETE

Sample Input 2

6 7
0 0 1 1 0 1
1 2
1 3
3 4
3 5
5 6
2 6
4 5

Sample Output 2

2 4

Sample Input 3

12 17
0 1 1 0 1 0 1 0 1 0 0 1
1 3
1 2
1 4
3 5
3 6
6 7
7 8
8 9
9 10
10 11
10 12
12 4
4 5
5 2
2 11
11 3
6 10

Sample Output 3

COMPLETE

Sample Input 4

30 45
0 1 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0
1 3
1 2
1 4
2 5
2 6
5 7
5 8
8 9
8 10
10 11
11 12
12 13
12 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
20 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 1
4 9
4 10
6 13
6 14
7 15
9 16
13 21
21 22
3 6
3 7
11 4
18 2
23 5
25 9
27 13

Sample Output 4

3 6 7 9

Sample Input 5

1 0
0

Sample Output 5

COMPLETE