#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream be("bfs.in");
ofstream ki("bfs.out");

void bfs(const vector<vector<int>> &adj, const int honnan, const int hova, int &eredmeny)
{
    vector<bool> visited(adj.size());
    queue<int> q;   

    visited[honnan] = 1;
    q.push(honnan);

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

        if(current == hova)
        {
            return;
        }

        bool kell_lepni = 0;

        for(int i : adj[current])
        {
            if(i == hova)
            {
                eredmeny++;

                return;
            }else if(!visited[i])
            {
                visited[i] = 1;
                q.push(i);

                kell_lepni = 1;
            }
        }

        if(kell_lepni)
        {
            eredmeny++;
        }
    }
    eredmeny = -1;
}

int main()
{
    int n, m, s;
    be >> n >> m >> s;

    vector<vector<int>> adj(n + 1);

    int x, y;

    for(int i = 0; i < m; i++)
    {
        be >> x >> y;
        adj[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
    {
        int eredmeny = 0;

        bfs(adj, s, i, eredmeny);

        ki << eredmeny << " ";
    }

    return 0;
}