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

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
const INF: i64 = std::i64::MAX/2;

fn solve() {
    let (n,m,p) = read!(usize,usize,i64);
    let (s,g) = read!(usize,usize);
    let uv = read!(usize,usize;m);
    let mut edge = vec![vec![];n];
    for (u,v) in uv {
        let a = u-1;
        let b = v-1;
        edge[a].push(b);
        edge[b].push(a);
    }
    let mut sdist = vec![vec![INF;2];n];
    let mut gdist = vec![vec![INF;2];n];
    dijkstra(&mut sdist, &edge, s-1);
    dijkstra(&mut gdist, &edge, g-1);
    let mut ans = vec![];
    for i in 0..n {
        for a in 0..2 {
            for b in 0..2 {
                let sum = sdist[i][a] + gdist[i][b];
                if sum%2 != p%2 {
                    continue;
                }
                if p>=sum {
                    ans.push(i);
                }
            }
        }
    }
    ans.dedup();
    if ans.len()==0 {
        println!("-1");
        return;
    }
    println!("{}",ans.len());
    for a in ans {
        println!("{}",a+1);
    }
}

fn dijkstra(mut dist: &mut Vec<Vec<i64>>, edge: &Vec<Vec<usize>>, s: usize) {
    dist[s][0] = 0;
    let mut q = BinaryHeap::new();
    q.push(Reverse((0_i64,s)));
    while let Some(Reverse((d,cur))) = q.pop() {
        for &e in &edge[cur] {
            let nd = d + 1;
            let p = (nd%2) as usize;
            if dist[e][p] <= nd {
                continue;
            }
            dist[e][p] = nd;
            q.push(Reverse((nd,e)));
        }
    }
}

fn run() {
    solve();
}