#include <iostream>
#include <vector>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <queue>

#define MAXSIZE 100000

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

vector<int> A[MAXSIZE];
int C[MAXSIZE];
queue<int> q;

void BFS(int start){
    memset(C, -1, sizeof(C));
    q.push(start);
    C[start] = 0;
    while(q.empty() == false){
        int nod = q.front();
        q.pop();
        /*
        for(int i = 0; i<A[nod].size(); i++){
            if(C[A[nod][i]] == -1){
                q.push(A[nod][i]);
                C[A[nod][i]] = C[nod] + 1;
            }
        }
        */
        vector<int>::iterator it;
        for(it = A[nod].begin(); it != A[nod].end(); it++){
            if(C[*it] == -1){
                q.push(*it);
                C[*it] = C[nod] + 1;
            }
        }
    }
}

int main()
{
    int N, M, S;
    in >> N >> M >> S;

    for(int i = 0; i<M; i++){
        int x, y;
        in >> x >> y;
        A[x-1].push_back(y-1);
    }
    BFS(S-1);
    for(int i = 0; i<N; i++){
        out << C[i] << " ";
    }
    return 0;
}