#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("C:\\Users\\serba\\Desktop\\af\\lab1_af\\bfs.in.txt");
ofstream fout("C:\\Users\\serba\\Desktop\\af\\lab1_af\\bfs.out.txt");
const int nmax = 1e5;
int d[nmax + 1];
bool viz[nmax + 1];
queue <int> q;
vector <int> g[nmax + 1];
void bfs(int x) {
	q.push(x);
	viz[x] = 1;
	d[x] = 0;
	while (!q.empty()) {
		int nod = q.front();
		q.pop();
		/*for (int i = 0; i < g[nod].size(); i++) {
			int vecin = g[nod][i];
			if (!viz[vecin]) {
				viz[vecin] = 1;
				d[vecin] = d[nod] + 1;
				q.push(vecin);
			}
		}*/
		for (auto vecin : g[nod]) {
			if (!viz[vecin]) {
				viz[vecin] = 1;
				d[vecin] = d[nod] + 1;
				q.push(vecin);
			}
		}
	}

}


int main()
{
	int n, m, s;
	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(d[i] == 0 && i != s )
			fout << -1 << " ";
		else
			fout << d[i] << " ";
	}
	return 0;
}