#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit (1<<18)
#define inf 500000000
#define N 100100
#define mod  1999999973
#define inu "bfs.in"
#define outu "bfs.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
vector<int> v[N];
queue<int> q,d;
int x,y,n,m,D[N],dis,nod,s,viz[N];
void bfs()
{
	q.push(s);
	d.push(0);
	viz[s]=1;
	while(!q.empty())
	{
		nod=q.front();
		q.pop();
		dis=d.front();
		d.pop();
		D[nod]=dis;
		for(int i=0;i<v[nod].size();++i)
			if(!viz[v[nod][i]])
			{
				q.push(v[nod][i]);
				d.push(dis+1);
				viz[v[nod][i]]=1;
			}
	}
}
	
int main ()
{
	f>>n>>m>>s;
	FOR(i,1,m)
	{
		f>>x>>y;
		v[x].push_back(y);
	}
	FOR(i,1,n)
	D[i]=-1;
	bfs();
	FOR(i,1,n)
	g<<D[i]<<" ";
	return 0;
}