You are given a directed acyclic graph with n vertices and m edges. There are no self-loops or multiple edges between any pair of vertices. Graph can be disconnected.

You should assign labels to all vertices in such a way that:

  * Labels form a valid permutation of length n — an integer sequence such that each integer from 1 to n appears exactly once in it. 
  * If there exists an edge from vertex v to vertex u then labelv should be smaller than labelu. 
  * Permutation should be lexicographically smallest among all suitable. 



Find such sequence of labels to satisfy all the conditions.

Input

The first line contains two integer numbers n, m (2 ≤ n ≤ 105, 1 ≤ m ≤ 105).

Next m lines contain two integer numbers v and u (1 ≤ v, u ≤ n, v ≠ u) — edges of the graph. Edges are directed, graph doesn't contain loops or multiple edges.

Output

Print n numbers — lexicographically smallest correct permutation of labels of vertices.

Examples

Input

3 3
1 2
1 3
3 2


Output

1 3 2 


Input

4 5
3 1
4 1
2 3
3 4
2 4


Output

4 1 2 3 


Input

5 4
3 1
2 1
2 3
4 5


Output

3 1 2 4 5 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vaibhav Pulastya
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EMinimalLabels solver = new EMinimalLabels();
        solver.solve(1, in, out);
        out.close();
    }

    static class EMinimalLabels {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            topSort T = new topSort(n);
            for (int i = 0; i < m; i++) {
                int u = in.nextInt() - 1;
                int v = in.nextInt() - 1;
                T.addEdge(v, u);
            }
            T.Tsort();
            for (int i = 0; i < n; i++) {
                out.print((T.pos[i] + 1) + " ");
            }
        }

        public class topSort {
            ArrayList<Integer>[] g;
            int[] pos;
            int n;

            topSort(int n) {
                this.n = n;
                g = new ArrayList[n];
                pos = new int[n];
                for (int i = 0; i < n; i++) {
                    g[i] = new ArrayList<>();
                }
            }

            void addEdge(int u, int v) {
                g[u].add(v);
            }

            boolean Tsort() {
                int[] indeg = new int[n];
                for (int u = 0; u < n; u++) {
                    for (int v : g[u]) {
                        indeg[v]++;
                    }
                }

                PriorityQueue<Integer> S = new PriorityQueue<>(new Comparator<Integer>() {

                    public int compare(Integer o1, Integer o2) {
                        return o2 - o1;
                    }
                });
                for (int i = 0; i < n; i++) {
                    if (indeg[i] == 0) S.add(i);
                }

                int num = n - 1;
                while (S.size() > 0) {
                    int u = S.poll();
                    pos[u] = num--;
                    for (int v : g[u]) {
                        --indeg[v];
                        if (indeg[v] == 0) {
                            S.add(v);
                        }
                    }
                }
                return num == n;
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}

