#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

int n,m,s;
const int nmax=100005;
vector < int > muchii[nmax];
queue < int  > coada;
int distanta[nmax];

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

void citire()
{
    f >> n >> m >> s;
    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[s] = 0;

    coada.push(s);
    bfs();
    for(int i = 1; i <= n; i++)
        g << distanta[i] << " ";

}

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