#include <fstream>
#include <list>
#include <vector>

using namespace std;

void bfs(int s, list<int> *adj, int n, ofstream &out) {
    vector<int> d(n, - 1);
    list<int> q;

    q.push_back(s);
    d[s] = 0;

    while (!q.empty()) {
        int u = q.front();
        q.pop_front();

        for (const auto& v : adj[u]) {
            if (d[v] == -1) {
                q.push_back(v);
                d[v] = d[u] + 1;
            }
        }
    }
    for (int i = 0; i < n; i++)
        out << d[i] << ' ';
}

int main(void) {
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    int n, m, s, x, y;
    in >> n >> m >> s;

    list<int> *adj = new list<int>[n];

    for (int i = 0; i < m; i++) {
        in >> x >> y;
        adj[--x].push_back(--y);
    }
    bfs(s - 1, adj, n, out);

    delete[] adj;
    in.close();
    out.close();
    return 0;
}