#include <bits/stdc++.h>

using namespace std;

ifstream r("santa.in");
ofstream w("santa.out");

int n, m, s, d, q, l[45003], up[45003];
vector <int> G[45003], art, stiva, ans;
vector <vector <int>> bicomp;
bool drum[45003], viz[45003], in[45003];

void com(int nod, int vecin)
{
    if(drum[vecin])
    {
        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)
{
    viz[nod] = 1;
    l[nod] = l[tata] + 1;
    up[nod] = l[nod];
    stiva.push_back(nod);
    in[nod] = 1;
    for(int vecin : G[nod])
    {
        if(vecin == tata){
            continue;
        }
        if(!viz[vecin])
        {
            dfs(vecin, nod);
            drum[nod] |= drum[vecin];
            up[nod] = min(up[nod], up[vecin]);
            if(up[vecin] >= l[nod]){
                com(nod, vecin);
            }
        }
        else if(in[vecin]){
            up[nod] = min(up[nod], l[vecin]);
        }
    }
}

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

int main()
{
    ios_base::sync_with_stdio(false);
    r >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        r >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    r >> s >> d >> q;
    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(art.begin(), art.end());
    }
    if(!drum[d] || find(bicomp[0].begin(), bicomp[0].end(), q) == bicomp[0].end())
    {
        w << "No chance";
        return 0;
    }
    art[0] = q;
    art.back() = 0;
    ans.push_back(q);
    for(int i = 1; i <= n; i++){
        viz[i] = 1;
    }
    for(int i = 0; i < bicomp.size(); i++)
    {
        for(int elem : bicomp[i]){
            viz[elem] = 0;
        }
        if(!bkt(1, bicomp[i].size(), art[i], art[i + 1]))
        {
            w << "No chance";
            return 0;
        }
    }
    w << ans.size() << "\n";
    for(int elem : ans)
    {
        w << elem << " ";
    }
    return 0;
}