Problem:
Score : 600 points

Problem Statement

Given is a directed graph G with N vertices and M edges.

The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.

It is guaranteed that the graph contains no self-loops or multiple edges.

Determine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.

Here the null graph is not considered as a subgraph.

Notes

For a directed graph G = (V, E), we call a directed graph G' = (V', E') satisfying the following conditions an induced subgraph of G:

V' is a (non-empty) subset of V.

E' is the set of all the edges in E that have both endpoints in V'.

Constraints

1 \leq N \leq 1000

0 \leq M \leq 2000

1 \leq A_i,B_i \leq N

A_i \neq B_i

All pairs (A_i, B_i) are distinct.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1
A_2 B_2
:
A_M B_M

Output

If there is no induced subgraph of G that satisfies the condition, print -1.
Otherwise, print an induced subgraph of G that satisfies the condition, in the following format:

K
v_1
v_2
:
v_K

This represents the induced subgraph of G with K vertices whose vertex set is \{v_1, v_2, \ldots, v_K\}. (The order of v_1, v_2, \ldots, v_K does not matter.)
If there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.

Sample Input 1

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

Sample Output 1

3
1
2
4

The induced subgraph of G whose vertex set is \{1, 2, 4\} has the edge set \{(1, 2), (2, 4), (4, 1)\}. The in-degree and out-degree of every vertex in this graph are both 1.

Sample Input 2

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

Sample Output 2

-1

There is no induced subgraph of G that satisfies the condition.

Sample Input 3

6 9
1 2
2 3
3 4
4 5
5 6
5 1
5 2
6 1
6 2

Sample Output 3

4
2
3
4
5

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

//! ----------------------------------------------
//! Framework <https://github.com/vain0x/procon>
//!
//! See the bottom of file for solution.
//! ----------------------------------------------

#![allow(unused_imports)]
#![allow(non_snake_case)]

use std::cell::RefCell;
use std::cmp::{max, min, Ordering};
use std::collections::*;
use std::fmt::{Debug, Display, Formatter, Write as FmtWrite};
use std::io::{stderr, stdin, BufRead, Write};
use std::mem::{replace, swap};
use std::ops::*;
use std::rc::Rc;

/// Print values to standard error if debug mode.
#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), stderr());
            writeln!(err, "\x1B[33m{}\x1B[0m = {:?}", e, $e).unwrap()
        })*
    };
}

/// Read from standard input and parse each word.
/// - `read!(T, U, ..)` parses a line as a tuple of words.
/// - `read![[T]]` parses a line as an array of words.
/// - `read![..; N]` parses `N` lines, using `read!(..)` repeatedly.
#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

/// Read a line from standard input.
#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    stdin().read_line(&mut buf).unwrap();

    #[allow(deprecated)]
    buf.trim_right().to_owned()
}

// -----------------------------------------------
// Solution
// -----------------------------------------------

/// 頂点
type Vertex = usize;

/// 頂点への探索経路
type Route = usize;

type Length = usize;

/// (p, q): p から q に合流するときにできる閉路
/// p: x -> ... -> v -> ... -> u (-> v)
/// q: x -> ... -> v
type Cycle = (Route, Route);

#[derive(Clone, Copy, Debug, PartialEq)]
enum State {
    /// 未訪問
    White,
    /// 訪問中
    Gray(Route),
    /// 訪問済み
    Black,
}

use State::*;

struct Solver {
    G: Vec<Vec<Vertex>>,
    links: Vec<(Vertex, Route, Length)>,
    states: Vec<State>,
    /// 発見した最短閉路
    mini: Option<(Length, Cycle)>,
}

impl Solver {
    fn route_len(&self, p: Route) -> Length {
        self.links[p].2
    }

    fn route_push(&mut self, v: Vertex, p: Route) -> Route {
        let q = self.links.len();
        let len = self.route_len(p) + 1;
        self.links.push((v, p, len));
        q
    }

    fn cycle_len(&self, (p, q): Cycle) -> Length {
        self.route_len(p) - self.route_len(q) + 1
    }

    fn cycle_to_vs(&self, (mut p, q): Cycle) -> Vec<Vertex> {
        let mut vs = vec![];
        while p != q {
            let (v, r, _) = self.links[p];
            vs.push(v);
            p = r;
        }
        vs
    }

    fn did_find_cycle(&mut self, c: Cycle) {
        let len = self.cycle_len(c);

        // 長さ2の閉路は条件を満たさない (入出次数が2以上になる) ので却下
        if len <= 2 {
            return;
        }

        if self.mini.map_or(false, |(min_len, _)| len >= min_len) {
            return;
        }

        self.mini = Some((len, c));
    }

    /// 閉路を探索する。
    fn dfs(&mut self, p: Route) {
        let (u, _, _) = self.links[p];
        match self.states[u] {
            Black => return,
            Gray(vp) => {
                self.did_find_cycle((p, vp));
                return;
            }
            White => {}
        }

        self.states[u] = Gray(p);

        for i in 0..self.G[u].len() {
            let v = self.G[u][i];
            if self.states[v] == Black {
                continue;
            }

            let q = self.route_push(v, p);
            self.dfs(q);
        }

        self.states[u] = Black;
    }

    fn solve(mut self) -> Option<Vec<Vertex>> {
        for u in 0..self.G.len() {
            if self.states[u] == Black {
                continue;
            }

            let p = self.route_push(u, 0);
            self.dfs(p);
        }

        self.mini.map(|(_, c)| self.cycle_to_vs(c))
    }
}

fn main() {
    let (N, M) = read!(usize, usize);
    let mut G = vec![vec![]; N];

    for _ in 0..M {
        let (u, v) = read!(usize, usize);
        G[u - 1].push(v - 1);
    }

    let vs_opt = Solver {
        G: G,
        states: vec![White; N],
        links: vec![(0, 0, 0); N],
        mini: None,
    }
    .solve();

    match vs_opt {
        None => println!("-1"),
        Some(vs) => {
            println!("{}", vs.len());
            for v in vs {
                println!("{}", v + 1)
            }
        }
    }
}