#include <bits/stdc++.h>
using namespace std;

int n,m,s,x,y,viz[100007];
vector<int>v[100007];
queue<int>q;

void bfs(int x) {
	q.push(x);
	viz[x]=1;
	while(!q.empty()) {
		x=q.front();
		q.pop();
		for (int i=0; i<v[x].size(); i++) {
			if (viz[v[x][i]]==0) {
				
				q.push(v[x][i]);
				viz[v[x][i]]=viz[x]+1;
			} 
		}
		
	}
}

int main() {
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");
	cin >> n >> m >> s;
	for (int i=1; i<=m; i++) {
		cin >> x >> y;
		v[x].push_back(y);
	}
	bfs(s);
	for(int i=1; i<=n; i++)
        if(viz[i]==0)
            cout <<-1<<" ";
        else
            cout <<viz[i]-1<<" ";
    return 0;
}