#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;

//```
#define ONLINE_JUDGE

const string file = "bfs";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)


int N, M, S;
vvi graph;
vi dist, viz;

void bfs(int S);

int main() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	int x, y;
	scanf("%d %d %d", &N, &M, &S);
	graph.resize(N);
	--S;
	for (int i = 0; i < M; ++i) {
		scanf("%d %d", &x, &y);
		--x; --y; 
		graph[x].pb(y);
	}
	
	bfs(S);
	
	for (auto it: dist) {
		printf("%d ", it);
	}
	return 0;
}

void bfs(int S) {
	int from;
	deque <int> dq;
	viz.resize(N, 0);
	dist.resize(N, -1);
	viz[S] = 1;
	dist[S] = 0;
	dq.pb(S);
	while (sz(dq) > 0) {
		from = dq.front();
		dq.pop_front();
		for (auto to:graph[from]) {
			if (viz[to] == 0) {
				viz[to] = 1;
				dist[to] = dist[from] + 1;
				dq.pb(to);
			}
		}
	}
}