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

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

void bfs(int S, queue <int> coada, int distante[], vector <int> graf[])
{
    do
    {
        int nod  = coada.front();
        coada.pop();

        int n = graf[nod].size();

        for (int i = 0; i < n; i++){
            if (distante[graf[nod][i]] == 0 && graf[nod][i] != S)
            {
                coada.push(graf[nod][i]);
                distante[graf[nod][i]] = distante[nod] + 1;
            }
        }
    }while (coada.size() > 0);
}

int main()
{
    int n, m, S;
    f>>n>>m>>S;

    vector <int> graf[n+1];

    int x, y;
    for (int i = 1; i <= m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }

    int distante[n+1] = {0};
    queue <int> coada;
    coada.push(S);

    bfs(S, coada, distante, graf);

    for (int i = 1; i <= n; i++)
    {
        if (distante[i] == 0 && i != S)
            g<<-1<<" ";
        else
            g<<distante[i]<<" ";
    }

    return 0;
}