#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int NMax=100005;

int N,M,S,Use[NMax],Sol,Start,D[NMax],C[NMax],k;
vector <int> G[NMax];

 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 BFS(int nod)
 {
    Use[Start]=1;
    C[1]=Start;
    k=1;
    for(int i=1;i<=N;++i)
        D[i]=-1;
    D[Start]=0;
    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]==0)
            {
                C[++k]=vecin;
                Use[vecin]=1;
                D[vecin]=D[nod]+1;
            }
        }
    }
 }

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