#include <iostream>
#include <fstream>
#include <vector>
#define Nmax 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int N,M,S,C[Nmax],Use[Nmax],D[Nmax],k;
vector <int> G[Nmax];

void Read()
{
    fin>>N>>M>>S;
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void BFS(int Nod)
{
    Use[S]=1;
    C[1]=S;
    k=1;
    for(int i=1;i<=N;++i)
        D[i]=-1;
    D[S]=0;
    for(int i=1;i<=k;++i)
    {
        int Nod=C[1];
        for(unsigned int j=0;j<G[Nod].size();++j)
        {
            int Vecin=G[Nod][i];
            if(!Use[Vecin])
            {
                C[++k]=Vecin;
                Use[Vecin]=1;
                D[Vecin]=D[Nod]+1;
            }
        }
    }
}


int main()
{
    Read();
    BFS(S);
    for(int i=1;i<=N;++i)
        fout<<D[i]<<" ";
    fout<<"\n";
    return 0;
}