#include<fstream>
#include<queue>
using namespace std;
int n, m, i, D[50003], x, y;
vector <int> L[50003];
queue <int> q;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int main(){
    in>>n>>m;
    for(i=1; i<=m; i++){
        in>>x>>y;
        D[y]++;
        L[x].push_back(y);
    }
    for(i=1; i<=n; i++){
        if(D[i]==0)
            q.push(i);
    }
    while(!q.empty()){
        x=q.front();
        out<<x<<" ";
        for(i=0; i<L[x].size(); i++){
            D[L[x][i]]--;
            if(D[L[x][i]]==0)
                q.push(L[x][i]);
        }
        q.pop();
    }
return 0;
}