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

int n, m, s;
const int NMAX = 1e5;
vector<int> G[NMAX + 1];	
int dist[NMAX + 1];

void bfs(int s) {
	queue<int> q;

	for (int i = 1; i <= n; i++) {
		dist[i] = 1e9;
	}
	dist[s] = 0;
	q.push(s);
	while(!q.empty()) {
		int node = q.front();
		q.pop();
		for (auto vecin : G[node]) { 
			if(dist[vecin] > dist[node] + 1) {
				dist[vecin] = dist[node] + 1;
				q.push(vecin);
			}
		}

	}
}

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main() {
	fin >> n >> m >> s;
	for (int i = 1; i <= m; i++) {
		int x,y;
		fin >> x >> y;
		G[x].push_back(y);
	}

	bfs(s);
	for (int i = 1; i<= n; i++) {
		if(dist[i] == 1e9) fout << -1 << ' ';
		else fout << dist[i] << ' ';
	}
}