#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector <int> graf[100003];queue <int> chestie;
int n,m,dist[100003],nod,s;
void bfs () {
	dist[chestie.front()]=1;
	while(chestie.size()!=0) {
		nod=chestie.front();
		for(int i=0;i<(int)graf[nod].size();++i)
			if(dist[graf[nod][i]]==0)
				dist[graf[nod][i]]=dist[nod]+1,chestie.push(graf[nod][i]);
		chestie.pop();
	}
}
int main () {
	int nr1,nr2;
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d%d%d", &n, &m, &s);
	for (int i=1;i<=m;++i)
		scanf("%d%d", &nr1, &nr2),graf[nr1].push_back(nr2);
	chestie.push(s);bfs();
	for(int i=1;i<=n;++i)
		printf("%d ", dist[i]-1);
	return 0;
}