#include <iostream>
#include <fstream>

using namespace std;

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

struct nod
{
    int info;
    nod *urm;
}*prim[50005];

int v[50005],k,n,m,viz[50005];

int cautare(nod *prim,int x)
{
    nod *q;
    for(q=prim;q;q=q->urm) if(q->info==x) return 1;
    return 0;
}

void adsf(nod *&prim,int x)
{
    nod *nou=new nod,*q;
    nou->info=x;
    if(prim==NULL) prim=nou;
    else
    {
    q=prim;
    while(q->urm!=NULL) q=q->urm;
    q->urm=nou;
    }
    nou->urm=NULL;
}

void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        if(cautare(prim[x],y)==0) adsf(prim[x],y);
    }
}

void DF(int x)
{
    v[++k]=x;
    viz[x]=1;
    for(nod *q=prim[x];q;q=q->urm)
        if(viz[q->info]==0) DF(q->info);
}

int main()
{
    citire();
    for(int i=1;i<=n;i++) if(viz[i]==0) DF(i);
    for(int i=1;i<=k;i++) fout<<v[i]<<" ";
    return 0;
}