#include <bits/stdc++.h>
using namespace std;
 
int noduri, arce, S, dist[100100];
vector <int> vecini[100100];
queue <int> Q;
 
ifstream fin("bfs.in");
ofstream fout("bfs.out");

void BFS() {
	while (!Q.empty()) {
		int Node = Q.front();
        Q.pop();
        for(int i = 0; i < vecini[Node].size(); i++) {
            if(dist[vecini[Node][i]] == -1) {
                Q.push(vecini[Node][i]);
                dist[vecini[Node][i]] = dist[Node] + 1;
            }
        }
	}
}
 
int main() {
    fin.tie(0);
    ios::sync_with_stdio(0);
    fin >> noduri >> arce >> S;
    for (int i = 1; i <= arce; ++i) {
        int x, y;
        fin >> x >> y;
        vecini[x].push_back(y);
    }
    for(int i = 1; i <= noduri; i++) {
        dist[i] = -1;
	}
	dist[S] = 0;
	Q.push(S);
	BFS();
    for(int i = 1; i <= noduri; i++) {
        fout << dist[i] << " ";
	}
    return 0;
}