You 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.