Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Graph Coloring

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given an undirected graph that consists of *n* vertices and *m* edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to blue, while all blue edges with an endpoint in this vertex change the color to red.

Find the minimum possible number of moves required to make the colors of all edges equal.

Input

The first line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 100 000) — the number of vertices and edges, respectively.

The following *m* lines provide the description of the edges, as the *i*-th of them contains two integers *u*_{i} and *v*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, *u*_{i} ≠ *v*_{i}) — the indices of the vertices connected by the *i*-th edge, and a character *c*_{i} () providing the initial color of this edge. If *c*_{i} equals 'R', then this edge is initially colored red. Otherwise, *c*_{i} is equal to 'B' and this edge is initially colored blue. It's guaranteed that there are no self-loops and multiple edges.

Output

If there is no way to make the colors of all edges equal output - 1 in the only line of the output. Otherwise first output *k* — the minimum number of moves required to achieve the goal, then output *k* integers *a*_{1}, *a*_{2}, ..., *a*_{k}, where *a*_{i} is equal to the index of the vertex that should be used at the *i*-th move.

If there are multiple optimal sequences of moves, output any of them.

Examples

Input

3 3

1 2 B

3 1 R

3 2 B

Output

1

2

Input

6 5

1 3 R

2 3 R

3 4 B

4 5 R

4 6 R

Output

2

3 4

Input

4 5

1 2 R

1 3 R

2 3 B

3 4 B

1 4 B

Output

-1

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/24/2017 14:47:44 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|