using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }




    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        var G = Enumerable.Range(0, N).Select(i => new List<int>()).ToArray();
        //H = Enumerable.Range(0, N).Select(i => new List<int>()).ToArray();


        var P = new int[N];
        var F = new int[N];
        var S = new int[N];
        for (int i = 0; i < N; i++)
        {
            P[i] = -100;
            F[i] = -100;
        }

        for (int i = 0; i < N + M - 1; i++)
        {
            int a = cin.nextint - 1;
            int b = cin.nextint - 1;
            G[a].Add(b);
            S[b]++;
        }

        for (int i = 0; i < N; i++)
        {
            if (S[i] == 0)
            {
                P[i] = -1;
                F[i] = 0;

                var A = new Queue<int>();
                A.Enqueue(i);
                var B = new Queue<int>();
                B.Enqueue(-1);
                var C = new Queue<int>();
                C.Enqueue(0);

                while (A.Any())
                {
                    var u = A.Dequeue();
                    var p = B.Dequeue();
                    var d = C.Dequeue();

                    if (F[u] != d)
                    {
                        continue;
                    }

                    foreach (var v in G[u])
                    {
                        if (S[v] == 1)
                        {
                            P[v] = u;
                            F[v] = F[u] + 1;

                            A.Enqueue(v);
                            B.Enqueue(u);
                            C.Enqueue(F[v]);
                        }
                        else
                        {
                            S[v]--;
                        }
     

                    }
                }

                break;
            }
        }

        for (int i = 0; i < N; i++)
        {
            WriteLine(P[i] + 1);
        }
    }

}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
    public void join<T>(IEnumerable<T> values) { WriteLine(string.Join(" ", values)); }
}


Measured memory_bytes: 32648