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

using namespace std;
//un graf orientat cu n varfuri si m arce
//se da un nod s sa se determine pentru fiecare nod x, numarul minim de arce
int n,m,s;
#define Nmax 100000
vector <int> la[Nmax];
int visited[Nmax];
int dist[Nmax];

void init_dist()
{
    for(int i=1;i<=n;i++)
        dist[i]=-1;
}
void bfs(int start)
{
    queue <int> coada;
    visited[start]=true;
    coada.push(start);
    while(!coada.empty())
    {   start = coada.front();
        coada.pop();
        for(auto i:la[start])
        {
            if(!visited[i])
            {
                visited[i] = true;
                coada.push(i);
                dist[i]=dist[start]+1;
            }
        }
    }
}
int main()
{   ifstream f ("bfs.in");
    ofstream g("bfs.out");
    init_dist();
    f>>n>>m>>s;
    for (int i=0;i<m;i++)
    {
        int x,y;
        f>>x>>y;
        la[x].push_back(y);
    }

    bfs(s);

    for(int i=1;i<=n;i++)
    {
        g<<dist[i]<<" ";
    }
    return 0;
}