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

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

    static class TaskE {
        public void solve(int testNumber, MyScanner in, PrintWriter out) {
            class Node {
                int out_count = 0;
                ArrayList<Integer> back_edges = new ArrayList<>();
            }

            int n = in.nextInt();
            int m = in.nextInt();

            ArrayList<Node> nodes = new ArrayList<>();
            for (int i = 0; i < n + 1; i++)
                nodes.add(new Node());

            for (int i = 0; i < m; i++) {
                int v = in.nextInt();
                int u = in.nextInt();

                nodes.get(u).back_edges.add(v);
                nodes.get(v).out_count++;
            }

            HashMap<Integer, TreeSet<Integer>> zMap = new HashMap<>();

            for (int i = 1; i <= n; i++) {
                int out_degree = nodes.get(i).out_count;
                zMap.putIfAbsent(out_degree, new TreeSet<>());
                zMap.get(out_degree).add(i);
            }

            int[] label = new int[n + 1];

            for (int i = n; i > 0; i--) {
                TreeSet<Integer> tree = zMap.get(0);
                int x = tree.last();
                for (int next : nodes.get(x).back_edges) {
                    zMap.get(nodes.get(next).out_count).remove(next);
                    nodes.get(next).out_count--;
                    zMap.putIfAbsent(nodes.get(next).out_count, new TreeSet<>());
                    zMap.get(nodes.get(next).out_count).add(next);
                }
                tree.remove(x);
                label[x] = i;
            }
            for (int i = 1; i <= n; i++) {
                out.print(label[i] + " ");
            }
            out.println();
        }

    }

    static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner(InputStream io) {
            br = new BufferedReader(new InputStreamReader(io));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    }
}

