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.util.*; 
import java.io.*;

public class momo {
	public static void main(String[] args) throws IOException{
		int x, y, a, b;
		Scanner scan = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out); 
		x = scan.nextInt();
		y = scan.nextInt();
		ArrayList<ArrayList<Integer>>q = new ArrayList<>();
		for(int i = 0;i < 100005;i++) {
			q.add(new ArrayList<Integer>());
		}
	    int []arr = new int[100005];
	    int []arr2 = new int[100005];
	    PriorityQueue<Integer> pq = new PriorityQueue<>(); 
		for(int i = 0;i < y;i++) {
			a = scan.nextInt();
			b = scan.nextInt();
			q.get(b).add(a);
			arr[a]++;
		}
		int count = x;
		for(int i = 1;i <= x;i++) {
			if(arr[i] <= 0) {
			   pq.add(-i);
			}
		}
		while(pq.size() > 0) {
			int n = -pq.poll();
			arr2[n] = count;
			count--;
			for(int item : q.get(n)) {
				arr[item]--;
				if(arr[item] == 0) {
					pq.add(-item);
				}
			}
		}
		for(int i = 1;i <= x;i++) {
			out.printf("%d ", arr2[i]);
		}
		out.print("\n");
		out.close();
	}
	public static class Scanner
    {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

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

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

        public long nextLong() throws IOException {return Long.parseLong(next());}
    }
}
