/**
1. 记录每个点的入度
2. BFS 时将可到达点的入度 减一, 并将入度为0 的点入队
*/

import java.util.*;
import java.util.stream.*;

class Main{

    List<List<Integer>> graph = new ArrayList<>();    
    int[] in;

    void run(){
        int n = jin.nextInt();
        int m = jin.nextInt();
        in = new int[n];

        for(int i = 0; i < n ; i++) graph.add(new ArrayList<>());

        for (int i = 0 ; i < m ; i++){
            int x = jin.nextInt() - 1;
            int y = jin.nextInt() - 1;
            add(x, y);
        }
        String res = topSort();

        System.out.println(res == null ? "-1": res);
    }

    void add(int x, int y){
        graph.get(x).add(y);
        in[y] ++ ;
    }

    String topSort(){
        Queue<Integer> queue = new LinkedList<>();
        List<Integer> res = new ArrayList<>();
        for (int i = 0 ; i < in.length ; i++){
            if (in[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()){
            int x = queue.poll();
            res.add(x);
            List<Integer> edges = graph.get(x);
            for (int j = 0 ; j < edges.size(); j ++){
                int p = edges.get(j);
                if (--in[p] == 0) queue.offer(p);
            }
        }

        if (res.size() != in.length) return null;
        return res.stream().map(x->String.valueOf(x+1)).collect(Collectors.joining(" "));
    }

    private Scanner jin = new Scanner(System.in);
    public static void main(String[] args) {new Main().run();}
}