/// Preset de infoarena
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("santa.in");
ofstream fout("santa.out");

const int maxN = 45005;
int n, m, s, d, q, depth[maxN], maxsus[maxN];
vector <int> G[maxN];
vector <int> pct_art, stiva, ans;
vector <vector <int>> bicomp;
bool drum[maxN], used[maxN], in[maxN];

void add_comp(int nod, int vecin)
{
    if(drum[vecin])
    {
        pct_art.push_back(nod);
        vector <int> comp;
        while(!stiva.empty() && stiva.back() != vecin)
        {
            in[stiva.back()] = 0;
            comp.push_back(stiva.back());
            stiva.pop_back();
        }
        comp.push_back(vecin);
        stiva.pop_back();
        in[vecin] = 0;
        comp.push_back(nod);
        bicomp.push_back(comp);
    }
    else
    {
        while(!stiva.empty() && stiva.back() != vecin)
        {
            in[stiva.back()] = 0;
            stiva.pop_back();
        }
        in[vecin] = 0;
        stiva.pop_back();
    }
}

void dfs(int nod, int tata)
{
    used[nod] = 1;
    depth[nod] = depth[tata] + 1;
    maxsus[nod] = depth[nod];
    stiva.push_back(nod);
    in[nod] = 1;
    for(int vecin : G[nod])
    {
        if(vecin == tata)
            continue;
        if(!used[vecin])
        {
            dfs(vecin, nod);
            drum[nod] |= drum[vecin];
            maxsus[nod] = min(maxsus[nod], maxsus[vecin]);
            if(maxsus[vecin] >= depth[nod])
                add_comp(nod, vecin);
        }
        else if(in[vecin])
            maxsus[nod] = min(maxsus[nod], depth[vecin]);
    }
}

bool bkt(int cnt, int sz, int nod, int cap)
{
    used[nod] = 1;
    if(cnt != 1)
        ans.push_back(nod);
    if(cnt == sz)
    {
        if(nod == cap || cap == 0)
            return 1;
        used[nod] = 0;
        ans.pop_back();
        return 0;
    }
    for(int vecin : G[nod])
    {
        if(used[vecin])
            continue;
        if((vecin != cap || cnt == sz - 1) && bkt(cnt + 1, sz, vecin, cap))
            return 1;
    }
    used[nod] = 0;
    ans.pop_back();
    return 0;
}

int main()
{
    ios_base::sync_with_stdio(false);
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    fin >> s >> d >> q;
    pct_art.push_back(s);
    drum[s] = 1;
    dfs(d, 0);
    if(find(bicomp[0].begin(), bicomp[0].end(), q) == bicomp[0].end())
    {
        reverse(bicomp.begin(), bicomp.end());
        reverse(pct_art.begin(), pct_art.end());
    }
    if(!drum[d] || find(bicomp[0].begin(), bicomp[0].end(), q) == bicomp[0].end())
    {
        fout << "No chance";
        return 0;
    }
    pct_art[0] = q;
    pct_art.back() = 0;
    ans.push_back(q);
    for(int i = 1; i <= n; i++)
        used[i] = 1;
    for(int i = 0; i < bicomp.size(); i++)
    {
        for(int elem : bicomp[i])
            used[elem] = 0;
        if(!bkt(1, bicomp[i].size(), pct_art[i], pct_art[i + 1]))
        {
            fout << "No chance";
            return 0;
        }
    }
    fout << ans.size() << '\n';
    for(int elem : ans)
        fout << elem << ' ';
    return 0;
}