#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
#define MAX 100100
using namespace std;
fstream in("bfs.in");
ofstream out("bfs.out");
vector<int> A[MAX];
int N, M, Start, L;
int cost[MAX];
int S[MAX];
void BFS(int nod) {
    L = 1;
    S[L] = nod;
    cost[nod] = 0;
    for(int i = 1; i <= L; i++)
        for(int j = 0; j < A[S[i]].size(); j++)
            if(cost[A[S[i]][j]] == -1) {
                S[++L] = A[S[i]][j];
                cost[S[L]] = cost[S[i]] + 1;
            }



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