#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int nmax = 100000;
int n, m, s;
vector< int > adj[nmax + 1];

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


int d[nmax + 1];
const int inf = 999999999;
void bfs(int start) {
    for(int i = 1; i <= n; i ++) {
        d[i] = inf;
    }

    queue <int> q;
    q.push(start);
    d[start] = 0;
    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        for (auto &v : adj[curr]) {
            if (d[v] == inf) {
                d[v] = d[curr] + 1;
                q.push(v);
            }
        }
    }
}

void afisare() {
    for(int i = 1; i <= n; i ++) {
        if (d[i] < inf) {
            fout << d[i] << ' ';
        }
        else {
            fout << "-1 ";
        }
    }
}

int main() {
    citire();
    bfs(s);
    afisare();
    exit(0);
}