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.awt.Point;

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
import java.util.function.Function;
import java.util.function.Supplier;

public class tests {
	static Scanner in = new Scanner();
	static PrintWriter out = new PrintWriter(System.out);
	static ArrayList<Integer> DAG[];
	static int inDegree[], ans[];
	// static Queue<Integer> q = new LinkedList<>();
	// static Stack<Integer> s = new Stack<>();
	static int count;;

	public static void main(String[] test) throws NumberFormatException, IOException {
		int n = in.nextInt();
		int m = in.nextInt();
		DAG = new ArrayList[n];
		inDegree = new int[n];
		ans = new int[n];
		for (int i = 0; i < n; i++) {
			DAG[i] = new ArrayList<>();
		}
		count = n;
		for (int i = 0; i < m; i++) {
			int u = in.nextInt() - 1;
			int v = in.nextInt() - 1;
			DAG[v].add(u);
			inDegree[u]++;
		}
		topo();
		for (Integer i : ans) {
			out.append(i + " ");
		}

		out.flush();
		out.close();
	}

	static void topo() {
		PriorityQueue<Integer> q = new PriorityQueue<>();
		for (int i = 0; i < DAG.length; i++) {
			if (inDegree[i] == 0) {
				q.add(-i);
			}
		}
		while (!q.isEmpty()) {
			int poll = -q.poll();
			ans[poll] = count--;
			for (int i = 0; i < DAG[poll].size(); i++) {
				if (--inDegree[DAG[poll].get(i)] == 0) {
					q.add(-DAG[poll].get(i));
				}
			}
		}

	}

	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String file) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(file));
		}

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

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

		String nextLine() throws IOException {
			return br.readLine();
		}

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

	}
}
