#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int nmax=100005;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;	

ll t;
ll n,m,s;
vector<int>v[nmax];
ll viz[nmax];
ll nr[nmax];
ifstream f("bfs.in");
ofstream g("bfs.out");
void bfs(int s) {
	queue<int>q;
	q.push(s);
	viz[s]=1;
	nr[s]=0;
	while (!q.empty()) {
		ll current=q.front();
		for (auto it:v[current]) {
			if (!viz[it]) {
				q.push(it);
				nr[it]=nr[current]+1;
				viz[it]=1;
			}
		}
		q.pop();
	}
	for (int i=1; i<=n; i++) {
		if (i==s) g << "0 ";
		else {
			g << nr[i] << " ";
		}
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	f >> n >> m >> s;
	for (int i=1; i<=n; i++) {
		nr[i]=-1;
	}
	for (int i=1; i<=m; i++) {
		ll x,y;
		f >> x >> y;
		v[x].pb(y);
	}
	bfs(s);
	

}