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


void citire()
{
    int x,y;
    fin>>N>>M>>S;
    for(int i=1;i<=M;i++)
        {
            fin>>x>>y;
            G[x].push_back(y);
        }
    fill(D,D+N+1,-1);
}

void BFS(int nod_start)
{
    int nod;
    D[nod_start]=0;
    coada.push(nod_start);

    while(!coada.empty())
    {
        nod=coada.front(); coada.pop();
        for(int i=0; i<G[nod].size(); i++)
            if(D[G[nod][i]]==-1)
            {
                coada.push(G[nod][i]);
                D[G[nod][i]]=D[nod]+1;
            }
    }
}

void afisare()
{
    for(int i=1; i<=N; i++)
        fout<<D[i]<<' ';
}
int main()
{
    citire();
    BFS(S);
    afisare();
    return 0;
}