#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 c[50001], rg[50001];

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


    u=0;
    for(i=1; i<=n; i++)
    {
        if(rg[i]==0)
        {
            u++;
            c[u]=i;
        }
    }

    p=1;
    while(p<=u)
    {
        fout<<c[p]<<' ';

        nod * t = prim[ c[p] ];

        while(t!=NULL)
        {
            rg[t->info]--;
            if(rg[t->info]==0)
            {
                u++;
                c[u]=t->info;
            }
            t=t->urm;
        }

        p++;
    }
}