#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define show(x) cerr << #x << " " << x << endl

typedef long long ll;
typedef unsigned long long ull;

constexpr const int INT_INF=0x3f3f3f3f; // 1061109567
constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f; // 4557430888798830399

template <typename T> bool chmin(T &a, T b) {
    if (a > b) {a = b;return true;}return false;
}

template <typename T> bool chmax(T &a, T b) {
    if (a < b) {a = b;return true;}return false;
}

// INT
#define GCD(a, b) __gcd(a, b)
template <typename T> T LCM(T a, T b) {return a / GCD(a, b) * b;}
template <typename T> T EXTGCD(T a, T b, T& x, T& y) {
    T d = a;
    if (b != 0) {d=EXTGCD(b,a%b,y,x);y-=(a/b)*x;}
    else x=1,y=0;
    return d;
}
template <typename T> bool is_prime(T a) {
    for(int i=2;i*i<=a;i++)if(a%i==0)return 1;
    return 0;
}

// MOD
const ll MOD = 1000000000 + 7;
#define add(a, b) ((a % MOD) + (b % MOD)) % MOD
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define sub(a, b) ((a % MOD) + MOD - (b % MOD)) % MOD
template <typename T> T mod_inverse(T a, T mod, bool prime){ // if mod is prime, "prime" is true.
    if(prime){
        T tmp=mod-2,now=a,res=1;while(tmp){if(tmp&1)res=mul(res,now);now=mul(now,now);tmp>>=1;}
        return res;
    }else{T x,y;EXTGCD(a,mod,x,y);return (mod+x%mod)%mod;}
}
#define divide(a, b) ((a % MOD) * (mod_inverse(b, MOD, true))) % MOD

//LLの数値をつかう時は最後にLをつける癖をつけよう
//
//  　　┓　　　┏
//  　＊┗┓　┏┛
//  　　　┫　┣　＊
//  　┏┳┻━┻┳┓
//  　┗┫　　　┣┛
//  ＊　┣　　━┃　＊        Merry Christmas!!
//  　┏┛　　〃┃
//  　┃●　　　┣━┳┓
//  　┗┻┳━━┛　┣┛
//  　＊　┃┏┓┣┓┃
//WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW

const int maxn = 100001;
int n, m;
vector <int> v[maxn];

vector <int> ans1, ans2;

bool past[maxn];
void dfs(int now) {
    past[now] = true;
    for (int i = 0; i < (int)v[now].size(); i++) {
        if (!past[v[now][i]]) {
            dfs(v[now][i]);
            break;
        }
    }
    ans1.push_back(now);
}

void dfs2(int now) {
    past[now] = true;
    for (int i = 0; i < (int)v[now].size(); i++) {
        if (!past[v[now][i]]) {
            dfs2(v[now][i]);
            break;
        }
    }
    ans2.push_back(now);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    FILE *stream1;
    //FILE *stream2;
    stream1 = freopen("/Users/aim_cpo/CLionProjects/competitive/in.txt", "r", stdin);
    //stream2 = freopen("out.txt", "w", stdout);
    if (stream1 == nullptr) return 0;
    //if (stream2 == NULL) return 0;
#endif
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int from, to; cin >> from >> to;
        from--; to--;
        v[from].push_back(to);
        v[to].push_back(from);
    }
    if (v[0].size() == 1) {
        dfs(0);
        cout << ans1.size() << endl;
        for (int i = 0; i < (int)ans1.size(); i++) {
            if (i == (int)ans1.size()) cout << ans1[i] << endl;
            else cout << ans1[i] + 1 << " ";
        }
    } else {
        dfs(0);
        for (int i : v[0]) {
            if (!past[i]) {
                dfs2(i);
                break;
            }
        }
        cout << ans1.size() + ans2.size() << endl;
        for (int i : ans1) {
            cout << i + 1 << " ";
        }
        reverse(all(ans2));
        for (int i = 0; i < (int)ans2.size(); i++) {
            if (i == ans2.size() - 1) cout << ans2[i] + 1 << endl;
            else cout << ans2[i] + 1 << " ";
        }
    }
#ifdef  LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.\n";
#endif
    return 0;
}

Measured memory_bytes: 9720