#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

#[derive(Eq, PartialEq, Clone, Debug)]
pub struct Rev<T>(pub T);
impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}
impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

fn solve() {
    let (n,m) = get!(usize, usize);
    let ab = get!(usize, usize;n-1+m);

    let mut nodes = vec![Vec::new(); n+1];
    let mut rnodes = vec![Vec::new(); n+1];

    let mut roots = (1..n+1).collect::<BTreeSet<_>>();
    for &(a,b) in &ab {
        roots.remove(&b);
        nodes[a].push(b);
        rnodes[b].push(a);
    }
    let root = roots.into_iter().next().unwrap();

    let mut degrees = vec![0; n+1];
    for i in 1..n+1 {
        degrees[i] = rnodes[i].len();
    }
    let mut add = Vec::new();
    add.push(root);
    let mut topo = Vec::new();
    while let Some(node) = add.pop() {
        topo.push(node);
        for &next in &nodes[node] {
            degrees[next] -= 1;
            if degrees[next] == 0 {
                add.push(next);
            }
        }
    }

    let mut indexes = vec![0; n+1];
    let mut parents = vec![0; n+1];
    for i in 0..topo.len() {
        let mut mxp = 0;
        let mut mx = 0;
        for &par in &rnodes[topo[i]] {
            if mx <= indexes[par] {
                mx = indexes[par];
                mxp = par;
            }
        }
        indexes[topo[i]] = i;
        parents[topo[i]] = mxp;
    }
    for i in 1..n+1 {
        println!("{}", parents[i]);
    }
}


Measured memory_bytes: 31612