#include <iostream>
#include <fstream>

using namespace std;

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

struct nod
{
    int info;
    nod * urm;
}*vecin[50001];

nod * prim[50001];

int rg[50001];

int main()
{
    int n, m, i, a, b, ramas;
    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;
        }
    }

    ramas=n;
    while(ramas!=0)
    {
        for(i=1; i<=n; i++)
        {
            if(rg[i]==0)
            {
                fout<<i<<' ';
                ramas--;
                rg[i]=-1;

                nod * t = prim[i];
                while(t!=NULL)
                {
                    rg[t->info]--;

                    t=t->urm;
                }
            }
        }
    }

}