#include <bits/stdc++.h>
using namespace std;

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

int n, m, smecher;
vector<int> dist;
vector<vector<int>> G;

void bfs(int start) {
    queue<int> q;
    q.push(start);
    dist[smecher] = 0;

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

        for(int x : G[node]) {
            if(dist[x] > dist[node] + 1) {
                q.push(x);
                dist[x] = dist[node] + 1;
            }
        }
    }
}

int main() {
    fin >> n >> m >> smecher;

    G.resize(n + 1);
    dist.resize(n + 1, 1e9);

    for(int x, y; m--;) {
        fin >> x >> y;
        G[x].push_back(y);
    }

    bfs(smecher);

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