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

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n, m;

int const NLIM = 100005;

vector < int > muchii[NLIM];

int distanta[NLIM];

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 nodstart;
    f >> n >> m >> nodstart;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        f >> x >> y;
        muchii[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        distanta[i] = -1;
    distanta[nodstart] = 0;
    coada.push(nodstart);
    bfs();
    for(int i=1; i<=n; i++)
        g << distanta[i] << " ";
    g<<'\n';
}

int main()
{
    citire();
    return 0;
}