#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,m_c;
bool viz[50000];
vector <int> M[50000];

void dfs(int nod)
{
    viz[nod]=true;
    for(int i=0;i<M[nod].size();i++)
    {
        if(!viz[M[nod][i]])
            dfs(i);
    }
    fout<<nod<<" ";
}

void read()
{
    int x,y;
    fin>>n>>m;
    m_c=m;
    for(;m;m--)
    {
        fin>>x>>y;
        M[x].push_back(y);
    }

}

int main()
{
    int i;
    read();
    for(;n;n--)
    {
        cout<<1;
        if(!viz[n])
            dfs(n);
    }
    return 0;
}