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

#define NMAX 100000

using namespace std;

vector<int> bfs(int n, int m, vector<int> adj[NMAX], int source) {
    vector<int> dist(n + 1, 0);
    vector<int> p(n + 1, 0);

    for (int i = 1; i <= n; ++i) {
        dist[i] = INT_MAX;
        p[i] = -1;
    }

    dist[source] = 0;
    p[source] = -1;

    queue<int> q;

    q.push(source);

    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (auto neigh : adj[node]) {
            if (dist[node] + 1 < dist[neigh]) {
                dist[neigh] = dist[node] + 1;
                p[neigh] = node;
                q.push(neigh);
            }
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (dist[i] == INT_MAX) {
            dist[i] = -1;
        }
    }

    return dist;
}

int main() {
    int n, m, s;

    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    fin >> n >> m >> s;

    vector<int> adj[NMAX];

    for (int i = 1, x, y; i <= m; ++i) {
        fin >> x >> y;
        adj[x].push_back(y);
    }

    vector<int> ans = bfs(n, m, adj, s);

    for (int i = 1; i <= n; ++i) {
        fout << ans[i] << " ";
    }

    return 0;
}