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

void Read()
{
    fin>>N>>M>>S;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
}
void Solve()
{
     for(int i=1;i<=k;i++)
        {
            int nod=C[i];
            for(unsigned int j=0;j<G[nod].size();j++)
                {
                    int vecin=G[nod][j];
                    if(!Use[vecin])
                        {
                            C[++k]=vecin;
                            Use[vecin]=1;
                            D[vecin]=D[nod]+1;
                        }
                }
        }
}
void Print()
{
    for(int i=1;i<=N;i++)
    fout<<D[i]<<" ";
}
int main()
{
    Read();
    for(int i=1;i<=N;i++)
    D[i]=-1;
    D[S]=0;
    C[1]=S;k=1;Use[S]=1;

    Solve();
    Print();
    return 0;
}