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

using namespace std;

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

int N, M;
int const NLIM = 100005;
vector <int> muchii[NLIM];
queue <int> coada;

int distanta[NLIM];

void BFS() {
	int nod, vecin;
	while (!coada.empty()) {
		nod = coada.front();
		coada.pop();
		for (unsigned int i = 0; i < muchii[nod].size(); ++i) {
			vecin = muchii[nod][i];
			if (distanta[vecin] == -1) {
				coada.push(vecin);
				distanta[vecin] = distanta[nod] + 1;
			}
		}

	}

}

void citire() {
	int nodStart;
	fin >> N >> M >> nodStart;
	for (int i = 1; i <= M; ++i) {
		int x, y;
		fin >> x >> y;
		muchii[x].push_back(y);
		muchii[y].push_back(x);
	}
	for (int i = 1; i <= N; ++i)
		distanta[i] = -1;
	distanta[nodStart] = 0;

	coada.push(nodStart);
	BFS();

	for (int i = 1; i <= N; ++i)
		fout << distanta[i] << " ";
}

int main() {
	citire();

	return 0;
}