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

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

#define NMAX 100005

int n, m, s, dis[NMAX];
vector<int> G[NMAX];
queue<int> q;

void citire() {
    f >> n >> m >> s;
    int x, y;
    for (int i = 1; i <= m; i++) {
        f >> x >> y;
        G[x].push_back(y);
    }
}

void initializare() {
    for (int i = 1; i <= n; ++i)
        dis[i] = -1;
}

void parcurgere_nod() {
    int nod_curent = q.front();
    q.pop();
    for (auto &nod_urmator: G[nod_curent])
        if (dis[nod_urmator] == -1) {
            dis[nod_urmator] = dis[nod_curent] + 1;
            q.push(nod_urmator);
        }
}

void parcurgere() {
    q.push(s);
    dis[s] = 0;
    while (!q.empty())
        parcurgere_nod();
}

void afisare() {
    for (int i = 1; i <= n; ++i)
        g << dis[i] << ' ';
}

int main() {
    citire();
    initializare();
    parcurgere();
    afisare();
    return 0;
}