#include <bits/stdc++.h>
#define speed cin.tie(0); ios::sync_with_stdio(0)
using namespace std;

vector<vector<int>> g;
int N, M, K;
vector<bool> cache;

bool goback(int s) {
    vector<bool> vis(N + 1);
    vector<int> from(N + 1);
    queue<int> q;
    vis[s] = 1;
    q.push(s);

    while (!q.empty()) {
        int node = q.front(); q.pop();

        if (cache[node]) {
            return 1;
        }

        if (node == K) {
            int curr = node;
            do {
                cache[curr] = 1;
                curr = from[curr];
            } while (curr);

            return 1;
        }

        for (int neigh : g[node]) {
            if (!vis[neigh]) {
                vis[neigh] = 1;
                from[neigh] = node;
                q.push(neigh);
            }
        }
    }

    return 0;
}

int main()
{
    speed;

    cin >> N >> M >> K;

    g.resize(N + 1);
    while (M--) {
        int U, V;
        cin >> U >> V;
        g[U].push_back(V);
    }

    vector<bool> vis(N + 1);
    queue<int> q;
    q.push(K);
    vis[K] = 1;
    while (!q.empty()) {
        int node = q.front(); q.pop();
        for (int neigh : g[node]) {
            if (!vis[neigh]) {
                q.push(neigh);
                vis[neigh] = 1;
            }
        }
    }

    vector<int> base;

    cache.resize(N + 1);

    for (int i = 1; i <= N; i++) {
        if (i != K && vis[i] && goback(i)) {
            base.push_back(i);
        }
    }

    unordered_set<int> result;
    for (int x : base) {
        result.insert(x);
        for (int neigh : g[x]) {
            if (neigh != K) result.insert(neigh);
        }
    }

    for (int neigh : g[K]) {
        result.insert(neigh);
    }

    if (result.empty()) {
        cout << 0;
        exit(0);
    }

    cout << result.size() << '\n';

    for (int x : result) cout << x << ' ';
    cout << '\n';
}