#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#define MAX 100005
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int x,y,N,M,S,viz[MAX];
vector<int>g[MAX];
queue<int>coada;
void citire()
{
    in>>N>>M>>S;
    int i;
    for(i=0;i<M;i++)
    {
        in>>x>>y;
        g[x].push_back(y);
    }
    for(i=1;i<=N;i++)
        viz[i]=-1;
}
void bfs()
{
    coada.push(S);
    viz[S]++;
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(unsigned i=0;i<g[nod].size();i++)
            if(viz[g[nod][i]]==-1)
            {
                coada.push(g[nod][i]);
                viz[g[nod][i]]=viz[nod]+1;
            }
    }
}
void tipar()
{
    for(int i=1;i<=N;i++)
        out<<viz[i]<<" ";
}
int main()
{
    citire();
    bfs();
    tipar();
}