#include <bits/stdc++.h>
#define INF 10000001
using namespace std;

int num_nodes;
int num_edges;
int num_conected_components;
int start;
vector<vector <int>> adj(100001);
vector<int> visited(100001);

void dfs(int node) {
    stack <int> dfs;
    dfs.push(start);
    while(!dfs.empty()) {
        int current=dfs.top();
        dfs.pop();
        visited[current]=1;
        for(auto next:adj[current])
            if(not visited[next])
                dfs.push(next);
    }
}

int main() {
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");

    fin>>num_nodes>>num_edges>>start;
    for(int i=1; i<=num_edges; i++) {
        int src,dest;
        fin>>src>>dest;
        adj[src].push_back(dest);
    }

    for(int i=1; i<=num_nodes; i++)
        if(not visited[i])
            dfs(i),num_conected_components++;

    fout<<num_conected_components;

    return 0;
}