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

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

	static class TaskC {
		final static int NUMBER_OF_LETTER = 26;
		final static char STARTING_LETTER = 'a';
		final static char QUESTION_MARK_LETTER = '?';

		private class Node implements Comparable<Node> {
			public int index = 0;
			public ArrayList<Node> edgesOut = new ArrayList<>();
			public ArrayList<Node> edgesIn = new ArrayList<>();
			int numberOfEdgesIn = 0;
			int numberOfEdgesOut = 0;
			int label = -1;

			@Override
			public int compareTo(Node o) {
				return o.index - index;
			}
		}

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			// TODO: need to learn how to do a topological ordering.
			int numberOfVertexs = in.nextInt();
			int numberOfEdges = in.nextInt();
			Node[] nodesArray = new Node[numberOfVertexs];

			for (int i = 0; i < numberOfVertexs; i++) {
				nodesArray[i] = new Node();
				nodesArray[i].index = i;
			}

			for (int currentEdgeNumber = 0; currentEdgeNumber < numberOfEdges; currentEdgeNumber++) {
				int u = in.nextInt() - 1;
				int v = in.nextInt() - 1;
				nodesArray[u].edgesOut.add(nodesArray[v]);
				nodesArray[v].edgesIn.add(nodesArray[u]);
				nodesArray[v].numberOfEdgesIn++;
				nodesArray[u].numberOfEdgesOut++;
			}

			PriorityQueue<Node> queue = new PriorityQueue<>();
			// MAX QUEUE! by index!
			// only nodes with no edges OUT can enter the queue.
			for (Node node : nodesArray)
				if (node.numberOfEdgesOut == 0)
					queue.add(node);
			
			int currentLabel = numberOfVertexs;
			while (!queue.isEmpty()) {
				Node currentNode = queue.poll();
				currentNode.label = currentLabel;
				currentLabel--;
				for(Node node: currentNode.edgesIn){
					node.numberOfEdgesOut--;
					if (node.numberOfEdgesOut == 0)
						queue.add(node);
				}
			}

			for (int i = 0; i < numberOfVertexs; i++) {
				out.printf("%d ", nodesArray[i].label);
			}
		}

	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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

		public double nextFloat() {
			return Double.parseDouble(next());
		}

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

	}
}
