#include <bits/stdc++.h>
using namespace std;

const int maxn=20001;
vector<int> adj[maxn];

int tin[maxn],low[maxn],par[maxn],timer=1;
bool is[maxn],can[maxn];
vector<int> ans;
int dest,sep;

void dfs(int v,int p){
    par[v]=p;
    tin[v]=low[v]=timer++;
    int children=0;
    for(int to:adj[v]){
        if(to==p)continue;
        if(tin[to])low[v]=min(low[v],tin[to]);
        else{
            dfs(to,v);
            low[v]=min(low[v],low[to]);
            children++;
            if(p!=-1&&low[to]>=tin[v])is[v]=true;
            if(to==sep&&low[to]<tin[v])sep=v;
        }
    }
    if(p==-1&&children>1)is[v]=true;
}

void dfs2(int v){
    can[v]=true;
    ans.push_back(v);
    for(int to:adj[v]){
        if(par[to]==v){
            dfs2(to);
        }
    }
}

int main(){
    int n,m,u;cin>>n>>m>>u>>dest;
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    sep=dest;
    dfs(u,-1);
    dfs2(sep);
    cout<<ans.size()<<'\n';
    for(int x:ans)cout<<x<<' ';cout<<'\n';
}