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

public class EIGHT25E 
{
    private ArrayList<Integer> adj[];
    private int inDegree[];
    private int labels[];
    private int n;
    
    public static void main(String[] args)
    {
        EIGHT25E e = new EIGHT25E();
        e.process();
    }
    
    public void process()
    {
        Scanner s = new Scanner(System.in);
        n = s.nextInt();
        int m = s.nextInt();
        
        adj = new ArrayList[n];
        inDegree = new int[n];
        
        for (int i = 0; i < n; i++)
        {
            adj[i] = new ArrayList<Integer>();
        }
        
        for (int i = 0; i < m; i++)
        {
            int v1 = s.nextInt();
            int v2 = s.nextInt();
            v1--;
            v2--;
            
            adj[v2].add(v1);
            inDegree[v1]++;
        }
        
        labels = new int[n];
        topoSort();
                
        for (int i = 0; i < n; i++)
        {
            System.out.print(labels[i] + " ");
        }
    }
    
    public void topoSort()
    {
        PriorityQueue<Integer> pq = new PriorityQueue<Integer>(Collections.reverseOrder());
        for (int i = 0; i < n; i++)
        {
            if (inDegree[i] == 0)
            {
                pq.add(i);
            }
        }
        
        int curLabel = n;
        while (!pq.isEmpty())
        {
            int cur = pq.poll();
            labels[cur] = curLabel;
            curLabel--;
            
            for (int j : adj[cur])
            {
                inDegree[j]--;
                if (inDegree[j] == 0)
                {
                    pq.add(j);
                }
            }
        }
    }

}
