#include <iostream>
#include <fstream>
#include  <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector <int> v[50014],sol;
int n,m,ext[50014];
void rezolva()
{
    int i,j,nod;
    for (i=1;i<=n;i++)
        if (ext[i]==0)
            sol.push_back(i);
    for (i=0;i<n;i++)
    {
        nod=sol[i];
        for (j=0;j<v[nod].size();j++)
        {
            ext[v[nod][j]]--;
            if (ext[v[nod][j]]==0)
                sol.push_back(v[nod][j]);
        }
    }
}
int main()
{
    int i,j,x,y;
    fstream f,g;
    f.open("sortaret.in",ios::in);
    g.open("sortaret.out",ios::out);
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        ext[y]++;
    }
    rezolva();
    for (i=0;i<n;i++)
        g<<sol[i]<<" ";
}