# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define fi(i,a,b) for (int i = a; i < b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define er erase
#define in insert
#define pi pair <int, int>
#define pii pair <pi, pi>
# define sz(x) (int)((x).size())
vector<int>v[100005];
int viz[100005],len[100005],n,m,s;
queue<int>q;
void bfs(int nod){
	viz[nod]=1;
	q.push(nod);
	while(!q.empty()){
	int s=q.front();
	q.pop();
	for(auto it:v[s]){
		if(viz[it])continue;
		viz[it]=1; len[it]=len[s]+1;
		q.push(it);
	}
	}
}


int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");
	cin>>n>>m>>s; int x,y;
	forn(i,1,n)len[i]=-1; len[s]=0;
	forn(i,1,m){
		cin>>x>>y;
		v[x].pb(y);
	}
	bfs(s);
	forn(i,1,n)cout<<len[i]<<' ';
return 0;
}