#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define endl "\n"
#define pll pair<ll, ll>
#define fs first
#define sc second
#define vll vector<ll>
#define v2d vector<vector<ll>>
#define vpll vector<pll>
#define qll queue<ll>
#define stll stack<ll>
#define sll set<ll>
#define mll map<ll, ll>

ll n, m, k;
v2d g;

void solve()
{
    cin >> n >> m >> k;
    g.resize(n);
    for (ll i = 0; i < m; i++)
    {
        ll in1, in2;
        cin >> in1 >> in2;
        g[in1-1].push_back(in2-1);
    }
    vector<bool> out(n);
    for (ll i = 0; i < n; i++)
    {
        if (i == k-1) continue;
        if (out[i] == 1) continue;
        qll q;
        q.push(i);
        vll c(n, 0);
        bool b = 0;
        while(!q.empty())
        {
            ll p = q.front();
            for (ll j = 0; j < g[p].size(); j++)
            {
                if (g[p][j] == k-1)
                {
                    b = 1;
                    break;
                }
                if (c[g[p][j]] == 0)
                {
                    q.push(g[p][j]);
                    c[g[p][j]] = 1;
                }
            }
            if (b == 1)
            {
                break;
            }
            c[p] = 2;
            q.pop();
        }
        if (b == 1)
        {
            out[i] = 1;
            for (ll j = 0; j < g[i].size(); j++)
            {
                out[g[i][j]] = 1;
            }
        }
    }
    out[k-1] = 0;
    cout << count(out.begin(), out.end(), 1) << endl;
    for (ll i = 0; i < n; i++)
    {
        if (out[i] == 1) cout << i+1  << " ";
    }
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}