Problem: The employees of the R1 company often spend time together: they watch football, they go camping, they solve contests. So, it's no big deal that sometimes someone pays for someone else.

Today is the day of giving out money rewards. The R1 company CEO will invite employees into his office one by one, rewarding each one for the hard work this month. The CEO knows who owes money to whom. And he also understands that if he invites person x to his office for a reward, and then immediately invite person y, who has lent some money to person x, then they can meet. Of course, in such a situation, the joy of person x from his brand new money reward will be much less. Therefore, the R1 CEO decided to invite the staff in such an order that the described situation will not happen for any pair of employees invited one after another.

However, there are a lot of employees in the company, and the CEO doesn't have a lot of time. Therefore, the task has been assigned to you. Given the debt relationships between all the employees, determine in which order they should be invited to the office of the R1 company CEO, or determine that the described order does not exist.

Input

The first line contains space-separated integers n and m <image> — the number of employees in R1 and the number of debt relations. Each of the following m lines contains two space-separated integers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi), these integers indicate that the person number ai owes money to a person a number bi. Assume that all the employees are numbered from 1 to n.

It is guaranteed that each pair of people p, q is mentioned in the input data at most once. In particular, the input data will not contain pairs p, q and q, p simultaneously.

Output

Print -1 if the described order does not exist. Otherwise, print the permutation of n distinct integers. The first number should denote the number of the person who goes to the CEO office first, the second number denote the person who goes second and so on.

If there are multiple correct orders, you are allowed to print any of them.

Examples

Input

2 1
1 2


Output

2 1 


Input

3 3
1 2
2 3
3 1


Output

2 1 3 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class CoderStrikeC
{

private static StringTokenizer st;
    
    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }
    
    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }
    
    public static String next()
    {
        return st.nextToken();
    }
    
    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }

    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }
    
    static int n, m;
    static HashSet<Integer>[] debts, rdebts;

    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        nextLine(br);
        n = nextInt();
        m = nextInt();
        debts = new HashSet[n];
        rdebts = new HashSet[n];
        
        for (int i = 0; i < n; i++)
        {
            debts[i] = new HashSet<Integer>();
            rdebts[i] = new HashSet<Integer>();
        }
        for (int i = 0; i < m; i++)
        {
            nextLine(br);
            int s = nextInt() - 1;
            int d = nextInt() - 1;
            debts[s].add(d);
            rdebts[d].add(s);
        }
        
        ArrayList<Integer> order = new ArrayList<Integer>();
        for (int i = 0; i < n; i++)
        {
            order.add(i);
        }
        Comparator<Integer> icomp = new Comparator<Integer>() {

            @Override
            public int compare(Integer x, Integer y)
            {
                if (rdebts[x].size() == rdebts[y].size()) return x - y;
                return rdebts[y].size() - rdebts[x].size();
            }
        };
        Collections.sort(order, icomp);
        
        ArrayList<Integer> ans = new ArrayList<Integer>();
        HashSet<Integer> left = new HashSet<Integer>();
        LinkedList<Integer> queue = new LinkedList<Integer>();
        for (int i = 0; i < n; i++)
        {
            left.add(i);
            queue.offer(order.get(i));
        }
        prev = new int[n];
        Arrays.fill(prev, -1);
        boolean found = false;
        HashSet<Integer> tried = new HashSet<Integer>();
        
        for (int i = 0; i < n; i++)
        {
            int pos = queue.poll();
            if (tried.contains(pos))
            {
                queue.offer(pos);
                continue;
            }
            left.remove(pos);
            if (dfs(pos, left, queue))
            {
                found = true;
                break;                
            }
            queue.offer(pos);
            left.add(pos);
        }
        if (!found)
        {
            System.out.println(-1);
            return;
        }
        
        int p = last;
        while (p != -1)
        {
            ans.add(p);
            p = prev[p];
        }
        
        StringBuffer sb = new StringBuffer();
        for (int i = ans.size() - 1; i >= 0; i--)
        {
            sb.append((ans.get(i) + 1) + " ");
        }
        System.out.println(sb.toString().trim());
    }
    
    static int[] prev;
    static int last;
    
    public static boolean dfs(int pos, HashSet<Integer> left, LinkedList<Integer> queue)
    {
        if (left.size() == 0)
        {
            last = pos;
            return true;
        }
        HashSet<Integer> tried = new HashSet<Integer>();
        while (!queue.isEmpty() && tried.size() < queue.size())
        {
            int next = queue.poll();
            if (tried.contains(next))
            {
                queue.offer(next);
                continue;
            }
            if (debts[pos].contains(next))
            {
                queue.offer(next);
                tried.add(next);
                continue;
            }
            tried.add(next);
            left.remove(next);
            boolean res = dfs(next, left, queue);
            if (res)
            {
                prev[next] = pos;
                return true;
            }
            left.add(next);
            queue.offer(next);
        }
        return false;
    }
    
}