#include <bits/stdc++.h>

using namespace std;

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

int const nlim = 100005;

vector <int> muchii[nlim];

int dist[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(dist[vecin] == -1)
            {
                coada.push(vecin);
                dist[vecin] = dist[nod] + 1;
            }
        }
    }
}

int main()
{
    int inceput;
    int n, m;

    f>>n>>m>>inceput;
    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++)
        dist[i] = -1;
    dist[inceput] = 0;
    coada.push(inceput);
    BFS();
    for( int i = 1; i <= n; i++)
        g<<dist[i]<<" ";

    return 0;
}