#include <bits/stdc++.h>

using namespace std;

ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");

int N, M, MAX, poz, k, x, y;
bool a[10003][10003];

int sol[500003];
void df(int x) {
    for(int i = 1; i <= N; i++) {
        if(a[x][i] == 1) {
            a[x][i] = a[i][x] = 0;
            sol[++k] = i;
            df(i);
        }
    }
}
int main()
{
    f >> N >> M;
    for(int i = 1; i <= M; i++) {
        f >> x >> y;
        a[x][y] = a[y][x] = 1;
        a[x][0]++;
        a[y][0]++;
        if(MAX <= a[x][0])
            MAX = a[x][0], poz = x;
        if(MAX <= a[y][0])
            MAX = a[y][0], poz = y;
    }
    df(poz);
    g << poz << " ";
    for(int i = 1; i <= k; i++)
        g << sol[i] << " ";
    return 0;
}