#include <iostream>
#include <fstream>
#define nmax 50005
#include <vector>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> L[nmax];
int n ,m;
bool viz[nmax];
int vectorsmecher[nmax],nr;

void Citire()
{
    int x,i,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);

    }
}

/*void Dfs(int x)
{   int i;
    viz[x]=1;
    for(i=L[x].begin();i!=L[x].end();i++)
     if(!viz[L[x][i]])
      Dfs(L[x][i]);
    vectorsmecher[++nr]=x;

}
*/
void DFS(int nod)
{
    vector <int>:: iterator i;
    viz[nod]=1;
    for(i=L[nod].begin();i!=L[nod].end();i++)
        if(!viz[*i])
            DFS(*i);
    vectorsmecher[++nr]=nod;
}




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