import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int n, m;
    scan(n, m);

    auto adj = new int[][](n, 0);
    foreach (i ; 0 .. n - 1 + m) {
        int ai, bi;
        scan(ai, bi);
        ai--, bi--;
        adj[bi] ~= ai;
    }

    auto ld = new int[](n);
    ld[] = -1;
    auto par = new int[](n);

    int dfs(int v) {
        if (ld[v] != -1) {
            return ld[v];
        }

        ld[v] = 0;

        foreach (u ; adj[v]) {
            if (ld[v] < dfs(u) + 1) {
                ld[v] = dfs(u) + 1;
                par[v] = u + 1;
            }
        }

        return ld[v];
    }

    foreach (v ; 0 .. n) {
        dfs(v);
    }

    writefln("%(%s\n%)", par);
}









void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
