#include <utility>
#include <vector>
#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;

const int MAX_NODURI = 100004;

int nNoduri, nMuchii, nodDeCalcul;
vector<int> muchii[MAX_NODURI];
int cost[MAX_NODURI];
bool isVisited[MAX_NODURI];

void citeste(){
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    cin >> nNoduri >> nMuchii >> nodDeCalcul;
    for(int i=0;i<nMuchii;++i){
        static int x,y;
        cin >> x >> y;
        muchii[x].push_back(y);
    }
}

void bfs(){
    queue<int> noduri;
    noduri.push(nodDeCalcul);

    while(!noduri.empty()){
        static int nod;
        static vector<int>::iterator vecin;

        nod = noduri.front();
        noduri.pop();
        isVisited[nod]=true;

        for(vecin = muchii[nod].begin(); vecin < muchii[nod].end(); ++vecin){
            if(!isVisited[*vecin]){
                cost[*vecin] = cost[nod] + 1;
                isVisited[*vecin] = true;
                noduri.push(*vecin);
            }
        }

    }
}

int main()
{
    citeste();
    bfs();
    for(int i=1;i<=nNoduri;++i){
        if (isVisited[i])
            printf("%d ",cost[i]);
        else
            printf("-1 ");
    }
    return 0;
}