#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define maxi 100010

using namespace std;

int N,M,S,cost[maxi];
vector<int> L[maxi];
queue<int> c;

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>N>>M>>S;
    int a,b,aux;
    for(int i=1;i<=M;i++)
    {
        f>>a>>b;
        L[a].push_back(b);

    }


    for(int i = 1; i <= N; i++)
        cost[i] = -1;

    cost[S] = 0;
    c.push(S);
    while(!c.empty())
    {
        for(auto i : L[c.front()])
            if(cost[i] == -1)
            {
                c.push(i);
                cost[i] = 1 + cost[c.front()];

            }

        c.pop();
    }

    for(int i=1;i<=N;i++)
        g<<cost[i]<<" ";

    return 0;
}