#include <fstream>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int gr[50050],n,m,x,y;
vector <int> a[50050];
queue <int> q;

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        a[x].push_back(y);
        gr[y]++;
    }
    for(int i=1; i<=n; ++i)
        if(gr[i]==0)
            q.push(i);

    int el;
    while(!q.empty())
    {
        el=q.front();q.pop();
        fout<<el<<' ';
        for(int j=0; j<a[el].size(); ++j)
        {
            gr[a[el][j]]--;
            if(gr[a[el][j]]==0)
                q.push(a[el][j]);
        }
    }
    return 0;
}