#include <fstream>
#include <vector>
#include <queue>
#define dim 50005
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,x,y,g[dim];
vector<int>v[dim];
queue<int>q;
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        v[x].push_back(y);
        g[y]++;
    }
    for(int i=1;i<=n;i++)
        if(g[i]==0)
            q.push(i);
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        cout<<nod<<" ";
        for(auto i:v[nod]){
            g[i]--;
            if(g[i]==0)
                q.push(i);
        }
    }
    return 0;
}