#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 100005

using namespace std;
vector <int> graph[Nmax];
int dist[Nmax];
int viz[Nmax];
void BFS(int x)
{
    int index,vecin,lim,i;
    queue <int> coada;
    coada.push(x);
    viz[x]=1;
    while(coada.empty()==0)
    {
        index=coada.front();
        lim=graph[index].size();
        for(i=0;i<lim;i++)
        {
            vecin=graph[index][i];
            if(viz[vecin]==0)
            {
                viz[vecin]=1;
                dist[vecin]=dist[index]+1;
                coada.push(vecin);
            }
        }
        coada.pop();
    }
}

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    int N,M,S,i,x,y;
    in>>N>>M>>S;
    for(i=0;i<M;i++)
    {
        in>>x>>y;
        graph[x].push_back(y);
    }
    BFS(S);
    for(i=1;i<=N;i++)
        if(dist[i]==0 && i!=S)
            dist[i]=-1;
    for(i=1;i<=N;i++)
        out<<dist[i]<<" ";
    return 0;
}