#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;
vector <int> graf[100005];
queue <int> coada;
int viz[100005];
int dist[100005];
void BFS(int S)
{
    int lim,i,index;
    coada.push(S);
    viz[S]=1;
    while(coada.empty()==0)
    {
        index=coada.front();
        coada.pop();
        lim=graf[index].size();
        for(i=0;i<lim;i++)
            if(viz[graf[index][i]]==0)
            {
                dist[graf[index][i]]=dist[index]+1;
                coada.push(graf[index][i]);
            }
    }
}
int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    int i,N,M,S,x,y;
    in>>N>>M>>S;
    for(i=1;i<=M;i++)
    {
        in>>x>>y;
        graf[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;
}