#include <fstream>
#include <vector>
#include <deque>
#define N 100005

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> L[N];
deque <int> coada;

bool viz[N];
int n,m,lungime[N],S;

void bfs()
{
    int i,x;

    coada.push_back(S);
    viz[S]=1;
    lungime[S]=0;

    while(!coada.empty())
    {
        x=coada.front();
        coada.pop_front();

        for(i=0; i<L[x].size(); i++)
        {
            if(!viz[L[x][i]])
            {
                coada.push_back(L[x][i]);
                lungime[L[x][i]]=lungime[x]+1;
                viz[L[x][i]]=1;
            }
        }
    }
}


int main()
{
   int x,y,i;
   fin>>n>>m>>S;
   for(i=1; i<=m; i++)
   {
       fin>>x>>y;
       L[x].push_back(y);

   }

   for(i=1; i<=n; i++) lungime[i]=-1;

   bfs();

   for(i=1; i<=n; i++) fout<<lungime[i]<<" ";




    return 0;
}