#include<fstream>
#include<vector>
#include<queue>

using namespace std;

int main(){
    ifstream in("sortaret.in");
    ofstream out("soraret.out");

    int n,m;
    in>>n>>m;

    vector<int> v[50001];
    int grad[50001];
    queue<int> q;
    for(int i=1;i<=n;i++) grad[i ]=0;

    for(int i=0;i<m;++i){
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;++i){
        if(!grad[i]) q.push(i);
    }
    for(int k=0;k<n;k++){
        int i=q.front();
        q.pop();
        for(int j=0;j<v[i].size();j++){
            grad[v[i][j]]--;
            if(!grad[v[i][j]]){
                q.push(v[i][j]);
            }
        }
        out<<i<<" ";
    }
}