#include <iostream>
#include <fstream>
#define Nmax 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
struct nod
{
    int info;
    nod *urm;
};
nod *a[Nmax];
void ADD (nod *&prim,int x)
{
    nod *q=new nod;
    q->info=x;
    q->urm=prim;
    prim=q;
}
int n,m;
void Citire()
{
    int i,x,y;
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
       ADD(a[x],y);
       ADD(a[y],x);
    }
}
int timpi_finali[Nmax],nr,viz[Nmax];
void DFS (int x)
{
    int i;
    nod *p;
    viz[x]=1;
    for (p=a[x];p!=NULL;p=p->urm)
        if(viz[p->info]==0)
        DFS(p->info);

    nr++;timpi_finali[nr]=x;
}
int main()
{int i;
    Citire();
    for (i=1;i<=n;i++)
        if (viz[i]==0) DFS(i);
    for (i=nr;i>=1;i--)
        fout<<timpi_finali[i]<<" ";
    return 0;
}