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

#define NMAX 100005

using namespace std;

int vizitat[NMAX];
int dist[NMAX];

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    vector<int> graph[NMAX];
    queue<int> coada;
    int N, M, S;
    f>>N>>M>>S;
    int x, y;
    for(int i = 1; i <= M; i++)
    {
        f>>x>>y;
        graph[x].push_back(y);
        //graph[y].push_back(x);
    }
    coada.push(S);
    vizitat[S] = 1;
    dist[S] = 0;
    while(!coada.empty())
    {
        int index = coada.front();
        int lim = graph[index].size();
        for(int i = 0; i < lim; i++)
        {
            int vecin = graph[index][i];
            if(!vizitat[vecin])
            {
                coada.push(vecin);
                dist[vecin] = dist[index] + 1;
                vizitat[vecin] = 1;
            }
        }
        coada.pop();
    }
    for(int i = 1; i <= N; i++)
    {
        if(dist[i] == 0 && i != S) dist[i] = -1;
        g<<dist[i]<<" ";
    }
    return 0;
}