using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            new Program().Solve(new ConsoleInput(Console.In, ' '));
#if DEBUG
            ReadLine();
#endif
        }

        public class Node
        {
            public int id;
            public int parentCount;
            public List<int> parents;
            public List<int> children;
            public int level;

            public Node(int id)
            {
                this.id = id;
                this.parents = new List<int>();
                this.children = new List<int>();
                this.level = -1;
            }
        }



        void Solve(ConsoleInput cin)
        {
            int n = cin.ReadInt;
            int m = cin.ReadInt;
            List<Node> graph = new List<Node>();

            for (int i = 0; i < n; i++)
            {
                graph.Add(new Node(i));
            }

            for (int i = 0; i < n - 1 + m; i++)
            {
                int a = cin.ReadInt - 1;
                int b = cin.ReadInt - 1;

                graph[a].children.Add(b);
                graph[b].parents.Add(a);

                graph[b].parentCount++;
            }

            // 親を見つける
            int[] parents = new int[n];
            int idParent = 0;
            while (graph[idParent].parents.Count() > 0)
            {
                idParent = graph[idParent].parents[0];
            }

            graph[idParent].level = 0;
            Queue<int> queue = new Queue<int>();
            queue.Enqueue(idParent);

            while (queue.Count() > 0)
            {
                int id = queue.Dequeue();

                foreach (int child in graph[id].children)
                {
                    graph[child].parentCount--;
                    if(graph[child].parentCount == 0)
                    {
                        parents[child] = id + 1;
                        queue.Enqueue(child);
                    }
                }
            }

            for (int i = 0; i < n; i++)
            {
                Console.WriteLine(parents[i]);
            }
        }

        class ConsoleInput
        {
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;

            public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
            {
                this._separator = separator;
                this._stream = stream;
                inputStream = new Queue<string>();
            }

            public string Read
            {
                get
                {
                    if (inputStream.Count != 0) return inputStream.Dequeue();
                    string[] tmp = _stream.ReadLine().Split(_separator);
                    for (int i = 0; i < tmp.Length; ++i)
                        inputStream.Enqueue(tmp[i]);
                    return inputStream.Dequeue();
                }
            }

            public string ReadLine { get { return _stream.ReadLine(); } }
            public int ReadInt { get { return int.Parse(Read); } }
            public long ReadLong { get { return long.Parse(Read); } }
            public double ReadDouble { get { return double.Parse(Read); } }
            public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
            public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
            public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
        }
    }
}

Measured memory_bytes: 43340