#include <bits/stdc++.h>

using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
int const N = 50001;
vector <int> v [N];
int p [N];
int main()
{
    int n , m;
    f >> n >> m;
    for(int i = 1 ; i <= m ; ++ i){
        int a , b;
        f >> a >> b;
        v [a].push_back (b);
        ++ p [b];
    }
    queue <int> q;
    for(int i = 1 ; i <= n ; ++ i)
        if (! p [i])
            q.push (i);
    while (q.size ()){
        int x = q.front ();
        q.pop ();
        g << x << ' ';
        for(auto y : v [x]){
            -- p [y];
            if (! p [y])
                q.push (y);
        }
    }

    return 0;
}