#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
struct nod
{
    int inf;
    nod *urm;
}*l[100001];
int n,m;
int u[50001],st[50001],nr=0;
void adaugnod(nod *&p,int x)
    {
        nod *c;
        c=new nod;
        c->inf=x;
        c->urm=p;
        p=c;
    }
void citire()
{
    int i;
    int x,y;
    f>>n>>m;
    for (i=1;i<=m;i++)
        {
            f>>x>>y;
            adaugnod(l[x],y);


        }

}
void df(int inf)
    {
        nod *p;
        u[inf]=1;
        for (p=l[inf];p;p=p->urm)
        if (!u[p->inf])
            df(p->inf);
        st[nr++]=inf;
    }
int main()
{
    int i;
    citire();
    for (i=1;i<=n;i++)
        if (!u[i])
            df(i);
    for (i=n-1;i>=0;i--)
        g<<st[i]<<" ";
    return 0;
}