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

using namespace std;

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

const int MAXN = 100005;

int n, m, s;
vector<int> adj[MAXN];
int dist[MAXN];

void bfs(int start) {
    for (int i = 1; i <= n; ++i) {
        dist[i] = -1;
    }

    queue<int> q;

    dist[start] = 0;
    q.push(start);

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

        for (int vecin : adj[nod]) {
            if (dist[vecin] == -1) {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    fin.tie(NULL);

    fin >> n >> m >> s;

    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v); // Doar orientat u -> v
    }

    bfs(s);

    for (int i = 1; i <= n; ++i) {
        fout << dist[i] << (i == n ? '\n' : ' ');
    }

    return 0;
}