#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n,m;
int const NMAX = 100001;
vector <int> muchii[NMAX];
int distanta[NMAX];
queue <int> coada;

void BFS()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i =0; i< muchii[nod].size();i++)
        {
            vecin= muchii[nod][i];
            if(distanta[vecin]==-1){
                coada.push(vecin);
                distanta[vecin]= distanta[nod]+1;
            }
        }
    }
}

void citire()
{
    int start;
    fin >> n >> m >>start;
    for (int i =1;i<=m;i++)
    {
        int x,y;
        fin >>x>>y;
        muchii[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        distanta[i]=-1;
    }
    distanta[start]=0;

    coada.push(start);
    BFS();
}

int main()
{
    citire();
    for(int i=1;i<=n;i++){
        fout << distanta[i]<<" ";
    }
    return 0;
}