#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define cin fin
#define cout fout
const int Nmax = 50000;
vector <int>g[Nmax + 5];
int n,m,x,y,use[Nmax+5],k,ts[Nmax+5];

void dfs(int nod)
{
    use[nod] = 1;
    for(int i=0; i< (int)g[nod].size();i++)
    {
        int vecin = g[nod][i];
        if(!use[vecin])
        dfs(vecin);
    }
    ts[++k] = nod;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
      g[x].push_back(y);
      g[y].push_back(x);
    }
    dfs(1);

    for(int i=n;i>=1;i--)
        cout<<ts[i]<<' ';
    return 0;
}