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

#define NMAX 100002

void read(int &n, int &s, std::vector < int > A[]) {
    int m, x, y;
    std::ifstream fin("bfs.in");
    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        fin >> x >> y;
        A[x].push_back(y);
    }
    fin.close();
}


void BFS(int n, int s, std::vector < int > A[], int viz[], int d[]) {
    int nod;
    std::queue < int > Q;
    Q.push(s);
    viz[s] = 1;
    d[s] = 0;
    while (!Q.empty()) {
        nod = Q.front();
        Q.pop();
        for (int i = 0; i < A[nod].size(); i++) {
            if (!viz[A[nod][i]]) {
                viz[A[nod][i]] = 1;
                d[A[nod][i]] = d[nod] + 1;
                Q.push(A[nod][i]);
            }
        }
    }
}


void print(int n, int s, int d[]) {
    std::ofstream fout("bfs.out");
    for (int i = 1; i <= n; i++) {
        if (s != i && d[i] == 0) {
            d[i] = -1;
        }
        fout << d[i] << " ";
    }
    fout.close();
}


int main(int argc, char *argv[]) {
    int n = 0, s = 0, viz[NMAX] = { 0 }, d[NMAX] = { 0 };
    std::vector < int > A[NMAX];
    read(n, s, A);
    BFS(n, s, A, viz, d);
    print(n, s, d);
    return 0;
}