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: Accepted)

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

// Finds a cycle. Not necessarily an induced cycle.
fn dfs1(v: usize, g: &[Vec<usize>], vis: &mut [bool], memo: &mut [bool])
        -> Result<(), Vec<usize>> {
    if vis[v] {
        return if memo[v] { Err(vec![v]) } else { Ok(()) };
    }
    vis[v] = true;
    memo[v] = true;
    for &w in &g[v] {
        if let Err(mut path) = dfs1(w, g, vis, memo) {
            if path.len() <= 1 || path[0] != path[path.len() - 1] {
                path.push(v);
            }
            return Err(path);
        }
    }
    memo[v] = false;
    Ok(())
}

fn restrict(mut g: Vec<Vec<usize>>, set: &HashSet<usize>) -> Vec<Vec<usize>> {
    let n = g.len();
    for i in 0..n {
        let v = std::mem::replace(&mut g[i], vec![]);
        if !set.contains(&i) {
            continue;
        }
        g[i] = v.into_iter().filter(|v| set.contains(v)).collect();
    }
    g
}

// Contract a loop and returns a shorter loop, if any exists.
fn shorten(sub: &Vec<usize>, g: &[Vec<usize>]) -> Vec<usize> {
    let n = g.len();
    let mut seen = vec![false; n];
    let m = sub.len();
    for i in 0..m {
        let v = sub[i];
        let nxt = sub[(i + 1) % m];
        for &w in &g[v] {
            if w == nxt { continue; }
            if seen[w] {
                // w -> ... -> v (-> w)
                let pos = sub.iter().position(|&v| v == w).unwrap();
                return sub[pos..i + 1].to_vec();
            }
            // (v ->) w -> ... -> sub[0] -> v
            let pos = sub.iter().position(|&v| v == w).unwrap();
            let mut ret = sub[pos..].to_vec();
            ret.extend_from_slice(&sub[..i + 1]);
            return ret;
        }
        seen[v] = true;
    }
    vec![]
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize, m: usize,
        ab: [(usize1, usize1); m],
    }
    let mut g = vec![vec![]; n];
    let mut mat = vec![vec![false; n]; n];
    let mut vis = vec![false; n];
    for &(a, b) in &ab {
        g[a].push(b);
        mat[a][b] = true;
    }
    let mut memo = vec![false; n];
    let mut sub = Ok(());
    for i in 0..n {
        let sub_tmp = dfs1(i, &g, &mut vis, &mut memo);
        if sub_tmp.is_err() {
            sub = sub_tmp;
            break;
        }
    }
    let mut sub = match sub {
        Ok(()) => {
            puts!("-1\n");
            return;
        }
        Err(x) => x,
    };
    sub.pop().unwrap();
    sub.reverse();
    let set = sub.iter().cloned().collect();
    let mut g = restrict(g, &set);
    loop {
        // debugln!("sub = {:?}, g = {:?}", sub, g);
        let k = shorten(&sub, &g);
        let set = k.iter().cloned().collect();
        g = restrict(g, &set);
        if k.len() == 0 {
            break;
        }
        sub = k;
    }
    puts!("{}\n", sub.len());
    for v in sub {
        puts!("{}\n", v + 1);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}