using namespace std;
#include <fstream>
ifstream fin("bfs.in");
ofstream fout("bfs.out");
#include<vector>
vector <int> G[100005];
bool Use[100005];
int N,M,S,C[100005],D[100005];
void citire()
{
    int i,x,y;
    fin>>N>>M>>S;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}
void BFS()
{
    int k,i;
    C[1]=S, k=1;
    Use[S]=1;
    for(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;
                D[Vecin]=D[Nod]+1;
                Use[Vecin]=1;
            }
        }
    }
}
void afisare()
{
    int i;
    for(i=1;i<=N;i++)
    {
        if(D[i]==0&&(i!=S))
            fout<<-1<<" ";
        else
            fout<<D[i]<<" ";
    }
}
int main()
{
    citire();
    BFS();
    afisare();
    return 0;
}