#include <fstream>
#include <vector>
#include <queue>
using namespace std;

const int kNMax = 100010;
int n, start, dist[kNMax];
vector<int> G[kNMax];
queue<int> Queue;

void Citire() {
    ifstream in("bfs.in");
    int x, y, m;
    in >> n >> m >> start;
    for (int i = 1; i <= m; ++i) {
        in >> x >> y;
        G[x].push_back(y);
    }
    in.close();
}

void Initializare() {
    for (int i = 1; i <= n; ++i)
        dist[i] = kNMax;
    dist[start] = 0;
}

void Solve() {
    int nod, vecin;
    Initializare();
    Queue.push(start);
    while (!Queue.empty()) {
        nod = Queue.front();
        Queue.pop();
        for (int i = 0; i < G[nod].size(); ++i) {
            vecin = G[nod][i];
            if (dist[vecin] > dist[nod] + 1) {
                Queue.push(vecin);
                dist[vecin] = dist[nod] + 1;
            }
        }
    }
}

void Afisare() {
    ofstream out("bfs.out");
    for (int i = 1; i <= n; ++i) {
        if (dist[i] == kNMax)
            out << -1 << ' ';
        else
            out << dist[i] << ' ';
    }
    out << '\n';
    out.close();
}

int main() {
    Citire();
    Solve();
    Afisare();
    return 0;
}