using namespace std;
#include <fstream>
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int gr[50001], n, m;
int coada[50001], k=0;
struct muchii
{
    int a,b;
}
v[100001];
void grad()
{
    int i;
    for(i=1; i<=m; i++)
        gr[v[i].b]++;
}
void parcurgere(int p)
{
    int i;
    for(i=1; i<=m; i++)
        if(v[i].a==p&&gr[v[i].b]!=0)
        {
            gr[v[i].b]--;
            if(gr[v[i].b]==0)
                {
                    k++;
                    coada[k]=v[i].b;
                }
        }
}
int main()
{
    int i, j, p;
    f>>n>>m;
    for(i=1; i<=m; i++)
        f>>v[i].a>>v[i].b;
    grad();
    for(i=1;i<=n;i++)
    {
        if(gr[i]==0)
        {
            k++;
            coada[k]=i;
        }
    }
    j=1;
    while(j<=k)
    {
        p=coada[j];
        g<<p<<' ';
        parcurgere(p);
        j++;
    }
    return 0;
}