Lk

#include <bits/stdc++.h>

#define Dmax 21
using namespace std;

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

int n, m, p, q, r, X[Dmax];
bool used[Dmax];

inline void print(int k)
{
    for (int i = 1; i <= k; ++i)
        fout << X[i] << " ";

    fout << '\n';
}

inline bool R_occurence(int k)
{
    for (int i = 1; i <= k; ++i)
        if (X[i] == r)
            return true;

    return false;
}

inline void DFS_Traversal(vector <set <int> > G, int k, int src)
{
    for (auto u : G[src])
    {
        if (!used[u])
        {
            used[u] = true;
            X[k] = u;
            if (u == q)
            {
                if (!R_occurence(k))
                    print(k);
            }
            else
                DFS_Traversal(G, k + 1, u);

            used[u] = false;
        }
    }
}

int main()
{
    fin >> n >> m;
    vector <set <int> > G(n + 1);

    for (int i = 1, x, y; i <= m; ++i)
    {
        fin >> x >> y;
        G[x].insert(y);
        G[y].insert(x);
    }

    fin >> p >> q >> r;

    used[p] = true;
    X[1] = p;
    DFS_Traversal(G, 2, p);

    fin.close(), fout.close();
    return 0;
}