Round Trip

                                #include<bits/stdc++.h>
using namespace std;
#define INF 2047483647
#define INFL 9223372036854775807
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ull unsigned long long
#define M 1000000007
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define take(x) scanf("%d",&x)
#define DE(x) printf("\ndebug %d\n",x);
#define vout(x) for(int i=0;i<x.size();i++) printf("%d ",x[i]);
#define pie acos(-1)
#define MOD 998244353


const int N = 1e5+5;
int parent[N],vis[N];
vector<int>adj[N];

void loop(int u,int v){
    int cnt = 0;
    int U = u;
    while(u!=v){
        cnt++;
        u = parent[u];
    }
    u = U;
    cout<<cnt+2<<endl;
    cout<<v+1<<" ";
    while(u!=v){
        cout<<u+1<<" ";;
        u = parent[u];
    }
    cout<<v+1;
    exit(0);
}

void dfs(int u){
    vis[u] = 1;
    for(auto v:adj[u]){
        if( vis[v] == 0 ){
            parent[v] = u;
            dfs(v);
        }else if( vis[v] == 1 and parent[u]!=v ){
            loop(u,v);
        }
    }
}

int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        a--;b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    for(int i=0;i<n;i++){
        if( vis[i] == 0 ) {
            parent[i] = -1;
            dfs(i);
        }
    }

    cout<<"IMPOSSIBLE";
}