#include <bits/stdc++.h>

using namespace std;

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

int n, m,nodStart;
int const nlim = 100005;
int d[nlim];
vector <int> v[nlim];
queue <int> c;

void BFS() {
    int nod, vecin;
    while (!c.empty()) {
        nod = c.front();
        c.pop();
        for (int i = 0; i < v[nod].size(); ++i) {
            vecin = v[nod][i];
            if (d[vecin] == -1) {
                c.push(vecin);
                d[vecin] = d[nod] + 1;
            }
        }
    }
}

void citire() {
    f >> n >> m >> nodStart;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        d[i] = -1;
    d[nodStart] = 0;
    c.push(nodStart);
    BFS();
    for (int i = 1; i <= n; ++i)
        g << d[i] << " ";
}

int main()
{
    citire();
    return 0;
}