#include <bits/stdc++.h>
#define DMAX 50010
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> a[DMAX];
vector<int> afis[DMAX];
void citire();
void rezolva();
int grad[DMAX];
int nivel[DMAX];
bool da[DMAX];
int n,m,nrsel;
queue<int> coada;
int main()
{
citire();

rezolva();
}
void citire()
{int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;

        a[x].push_back(y);
        grad[y]++;
    }
    for(i=1;i<=n;i++)
        {if(grad[i]==0)
        {
            nivel[i]=1;
            coada.push(i);
            afis[nivel[i]].push_back(i);
            da[i]=1;
            nrsel++;
        }

        }


}
void rezolva()
{int varf,i,j;
    while(nrsel<n)
{
    varf=coada.front();

        coada.pop();

        for(i=0;i<a[varf].size();i++)
        {if(!da[a[varf][i]])
            {grad[a[varf][i]]--;
        if(grad[a[varf][i]]==0)
        {nivel[a[varf][i]]=nivel[varf]+1;
        coada.push(a[varf][i]);da[a[varf][i]]=1;nrsel++;
        afis[nivel[a[varf][i]]].push_back(a[varf][i]);
        }
            }
        }
        grad[varf]=-1;

    }
    for(i=1;i<=n;i++)
        if(!afis[i].size())
            break;
        else
            for(j=0;j<afis[i].size();j++)
                fout<<afis[i][j]<<' ';
}