#include <iostream>
#include <list>
using namespace std;

bool hasInt(int target, list<int> field) {
    for (int i : field) {
        if (i == target) return true;
    }
    return false;
}

int main()
{
    int numberOfNodes, routes, startID;
    cin >> numberOfNodes;
    cin >> routes;
    cin >> startID;

    struct Node {
        list<int> outgoing;
        list<int> incoming;
        void connected(list<int> &connectedByIncoming, list<int> &connectedByOutgoing,Node nodesList[]) {
            for (int i : incoming) {
                if (!hasInt(i, connectedByIncoming)) {
                    connectedByIncoming.push_back(i);
                    nodesList[i].connected(connectedByIncoming, connectedByOutgoing, nodesList);
                }
            }
            for (int i : outgoing) {
                if (!hasInt(i, connectedByOutgoing)) connectedByOutgoing.push_back(i);
            }
        }
    };
    Node nodes[numberOfNodes];

    //read all routes from stdin
    for (int i = 0; i < routes; i++) {
        int startPoint, endPoint;
        cin >> startPoint;
        cin >> endPoint;
        Node &startNode = nodes[startPoint-1];
        Node &endNode = nodes[endPoint-1];
        startNode.outgoing.push_back(endPoint-1);
        endNode.incoming.push_back(startPoint-1);
    }

    list<int> connectedByIncoming;
    list<int> connectedByOutgoing;
    nodes[startID-1].connected(connectedByIncoming, connectedByOutgoing, nodes);
    list<int> allConnected;
    allConnected.merge(connectedByIncoming);
    for (int i : connectedByOutgoing) {
        if (!hasInt(i, allConnected)) allConnected.push_back(i);
    }
    int size = allConnected.size();
    if (hasInt(startID-1, allConnected)) size--;
    cout << size << "\n";
    for (int i : allConnected) {
        if (i != startID - 1) cout << i+1 << " ";
    }

    return 0;
}