/*

Sviatoslav Bidzilia 2019
CF: anakib1

*/

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define int long long

template<typename A, typename B, typename C>
struct triple
{
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0)
{
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b)
{
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p)
{
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a)
{
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c)
{
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c)
{
    return min(a, min(b, c));
}
struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
vector<vi> g;
int n;
set<int> now;
void dfs(vector<vi>& gg, int v)
{
    now.insert(v);
    for (auto to : gg[v])
        if (!now.count(to))
            dfs(gg, to);
}
pair<vi, vi> bfs(int v)
{
    queue<int> q;
    vi d(n, inf);
    d[v] = 0;
    q.push(v);
    vector< vi > p(n);
    now.clear();
    while (q.size())
    {
        int v = q.front();
        q.pop();
        for(auto to : g[v])
            if (d[to] == d[v] + 1)
            {
                p[to].pb(v);
            }
            else if(d[to] > d[v] + 1)
            {
                p[to].clear();
                p[to].pb(v);
                d[to] = d[v] + 1;
                q.push(to);
            }
    }
    dfs(p, n - 1);
    vi ans;
    for (auto i : now)
        ans.pb(i);
    return mp(ans, d);
}
signed main()
{
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    srand(time(NULL));
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
    cin >> n;
    g.resize(n);
    int m;
    cin >> m;
    int x, y, z;
    cin >> x >> y >> z;
    x--, y--, z--;
    rng(m)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g[a].pb(b);
        g[b].pb(a);
    }
    set<int> a1;
    auto t = bfs(x);
    for (auto x : t.F)
        a1.insert(x);
    vi d1 = t.second;
    set<int> a2;
    t = bfs(y);
    for (auto x : t.F)
        a2.insert(x);
    vi d2 = t.second;
    set<int> a3;
    t = bfs(z);
    for (auto x : t.F)
        a3.insert(x);
    vi d3 = t.second;
    vi ans;
    for (int i = 0; i + 1 < n; i++)
        if (a1.count(i) && a2.count(i) && a3.count(i) && d1[i] == d2[i] && d2[i] == d3[i])
            ans.pb(i + 1);
    cout << ans.size() << '\n';
    print(ans);
}