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

using namespace std;

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

vector<vector<int>> graf;
vector<int> dist;

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

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

        for (int v : graf[u]) {
            if (dist[v] == -1) { 
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
}

int main() {
    int n, m, S;
    fin >> n >> m >> S;

    graf.resize(n + 1);
    dist.assign(n + 1, -1);

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

    bfs(S);

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

    fin.close;
    fout.close;
    return 0;
}