#include <bits/stdc++.h>

#define NMax 100005

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int N,M,S;
vector<int> G[NMax];
int Dist[NMax];

void BFS(int source)
{
    queue<int> Queue;

    memset(Dist,-1,sizeof(Dist));
    Dist[source]=0;

    Queue.push(source);
    while(!Queue.empty())
    {
        int node=Queue.front();
        Queue.pop();
        for(auto child : G[node])
            if(Dist[child]==-1)
            {
                Dist[child]=Dist[node]+1;
                Queue.push(child);
            }
    }

}

int main()
{
    fin>>N>>M>>S;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }

    BFS(S);

    for(int i=1;i<=N;i++)
        fout<<Dist[i]<<" ";

    return 0;
}