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.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.Map;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Liavontsi Brechka
 */
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);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static
    @SuppressWarnings("Duplicates")
    class TaskE {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskE.Node[] nodes = new TaskE.Node[n];
            for (int i = 0; i < n; i++) nodes[i] = new TaskE.Node();

            int u, v;
            for (int i = 0; i < m; i++) {
                u = in.nextInt() - 1;
                v = in.nextInt() - 1;
                nodes[v].adj.add(u);
                nodes[u].outCount++;
            }

            Map<Integer, TreeSet<Integer>> map = new HashMap<>();
            for (int i = 0; i < n; i++) {
                map.putIfAbsent(nodes[i].outCount, new TreeSet<>());
                map.get(nodes[i].outCount).add(i);
            }

            TreeSet<Integer> nextTree;
            int[] label = new int[n];
            for (int i = n; i > 0; i--) {
                nextTree = map.get(0);
                u = nextTree.last();
                for (Integer next : nodes[u].adj) {
                    map.get(nodes[next].outCount).remove(next);
                    nodes[next].outCount--;
                    map.putIfAbsent(nodes[next].outCount, new TreeSet<>());
                    map.get(nodes[next].outCount).add(next);
                }
                nextTree.remove(u);
                label[u] = i;
            }
            StringBuilder res = new StringBuilder();
            for (int l : label) {
                res.append(l).append(' ');
            }
            out.print(res);
        }

        private static class Node {
            int outCount;
            ArrayList<Integer> adj;

            public Node() {
                outCount = 0;
                adj = new ArrayList<>();
            }

        }

    }

    static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(readLine());
            }
            return tokenizer.nextToken();
        }

        public String readLine() {
            String line;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

    }
}

