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

using namespace std;

int n,m,i,gr[50005],x,y;
queue<int> q;
vector<int> g[50005];

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortare.out");
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y;
        g[x].push_back(y);
        ++gr[y];
    }
    for(i=1;i<=n;++i)
        if(!gr[i]) q.push(i);
    while(!q.empty())
    {
        x=q.front();
        fout<<x<<' ';
        q.pop();
        for(vector<int>::iterator it=g[x].begin();it!=g[x].end();++it)
        {
            --gr[*it];
            if(!gr[*it]) q.push(*it);
        }
    }
    return 0;
}