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 
//package kattis.Codeforces;


import java.io.*;
import java.util.*;

public class E425 {
	public static void main(String[] args) throws IOException {
		IO io = new IO(System.in);
		int n = io.nextInt(), m = io.nextInt();
		ArrayList<ArrayList<Integer>> parents = new ArrayList<ArrayList<Integer>>(n);
		ArrayList<ArrayList<Integer>> kids = new ArrayList<ArrayList<Integer>>(n);
		for (int i = 0; i < n; i++) {
			parents.add(new ArrayList<Integer>());
			kids.add(new ArrayList<Integer>());
		}
		for (int i = 0; i < m; i++) {
			int par = io.nextInt() - 1;
			int kid = io.nextInt() - 1;
			parents.get(kid).add(par);
			kids.get(par).add(kid);
		}
		PriorityQueue<Integer> q = new PriorityQueue<Integer>((i1, i2) -> Integer.compare(i2, i1));
		for (int i = 0; i < n; i++) {
			if(kids.get(i).size() == 0) {
				q.add(i);
			}
		}
		int cur = n;
		int[] p = new int[n];
		while(!q.isEmpty()) {
			int node = q.poll();
			p[node] = cur--;
			for(Integer i : parents.get(node)) {
				kids.get(i).remove(kids.get(i).indexOf(node));
				if(kids.get(i).size() == 0) {
					q.add(i);
				}
			}
		}
		for (int i = 0; i < p.length; i++) {
			io.print(p[i] + " ");
		}
		io.println();
		io.close();
	}

	
	static class IO extends PrintWriter {
		static BufferedReader r;
		static StringTokenizer t;

		public IO(InputStream i) {
			super(new BufferedOutputStream(System.out));
			r = new BufferedReader(new InputStreamReader(i));
			t = new StringTokenizer("");
		}

		public String next() throws IOException {
			while (!t.hasMoreTokens()) {
				t = new StringTokenizer(r.readLine());
			}
			return t.nextToken();
		}

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

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

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
}
}

