#include <iostream>
#include <fstream>
using namespace std;
struct nod{int x;nod* urm;};
nod* L[500001];
int n,s[500001],u[500001],ns,m;
void Adauga_Leg(nod*& p, int x)
{
    nod* c = new nod;
    c->x=x;
    c->urm=p;
    p=c;
}
void Citeste()
{
    ifstream f("sortaret.in");
    f>>n>>m;
    int x,y;
    while(f>>x>>y)
    {
        Adauga_Leg(L[x],y);
    }
    f.close();
}
void DF(int x)
{
    u[x]=1;
    for(nod* c=L[x];c;c=c->urm)
        if(!u[c->x]) DF(c->x);
    s[++ns]=x;
}
void Scrie()
{
    ofstream g("sortaret.out");
    for(int i=n;i>0;i--)
        g<<s[i]<<" ";
    g.close();
}
int main()
{
    Citeste();
    for(int i=1;i<=n;i++)
        if(!u[i])DF(i);
    Scrie();
    return 0;
}