#include <iostream>
#include <fstream>

using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

struct nod
{
    int info;
    nod * urm;
};

nod * vecin[50001], * prim[50001];

int rg[50001];
bool viz[50001];

void DFS (int x)
{
    int i;
    viz[x]=1;


    nod * t = prim[x];

    while(t!=NULL)
    {
        rg[t->info]--;
        if(rg[t->info]==0)
        {
            fout<<t->info<<' ';
            rg[t->info]=-1;
        }

        if(viz[t->info]==0)
        {
            DFS(t->info);
        }

        t=t->urm;
    }
}


int main()
{
    int n, m, i, a, b;
    fin>>n>>m;

    for(i=1; i<=m; i++)
    {
        fin>>a>>b;

        rg[b]++;

        nod * aux = new nod;
        aux->info=b;
        aux->urm=NULL;

        if(prim[a]==NULL)
        {
            prim[a]=aux;
            vecin[a]=aux;
        }

        else
        {
            vecin[a]->urm=aux;
            vecin[a]=aux;
        }
    }

    for(i=1; i<=n; i++)
    {
        if(rg[i]==0)
        {
            fout<<i<<' ';
            rg[i]=-1;
            DFS(i);
        }
    }
}