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

using namespace std;

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

const int NLIM=100005;
int N, M, S, dist[NLIM];
vector <int> V[NLIM];
queue <int> Coada;

void BFS()
{
    int Nod;
    while(!Coada.empty())
    {
        Nod=Coada.front();
        Coada.pop();
        for(unsigned int i=0; i<V[Nod].size(); i++)
        {
            if(dist[V[Nod][i]]==-1)
            {
                Coada.push(V[Nod][i]);
                dist[V[Nod][i]]=dist[Nod]+1;

            }
        }
    }
}

int main()
{
    f>>N>>M>>S;
    int x, y;
    for(int i=1; i<=M; ++i)
    {
        f>>x>>y;
        V[x].push_back(y);
    }

    for(int i = 1; i <= N; i++)
        dist[i] = -1;
    dist[S] = 0;

    Coada.push(S);

    BFS();

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