#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include<map>
#include<algorithm>
#include<string>
#include <queue>
#define maxiim 1e5;
using namespace std;
ifstream in("read.txt");
ofstream out("out.txt");
int n, m,s;
vector<vector<int>>sir;
vector<bool>visited;
vector<int>destinatii;
void stabilizare()
{
    sir.resize(n+1);
	visited.resize(n+1);
	destinatii.resize(n + 1);
	for (int i = 0; i < n + 1; i++)
		visited[i] = false;
	for (int i = 0; i < n + 1; i++)
		destinatii[i] = -1;
	
}
void BFS(int x,int z)
{
	queue<int> q;
	q.push(x);
	visited[x] = true;
	destinatii[x] = 0;

	while (!q.empty())
	{
		int y = q.front();
		q.pop();

		for(int j:sir[y])
			if (!visited[j])
			{
				visited[j] = true;
				q.push(j);
				destinatii[j] = destinatii[y] + 1;
			}
	}
	
}
int main()
{
	in >> n >> m>>s;
	stabilizare();
	for (int i = 0; i < m; i++)
	{
		int x, y;
		in >> x >> y;
		sir[x].push_back(y);
	}
	for (int i = 1; i <= n; i++) {
		BFS(s, i);
		out << destinatii[i] << " ";
	}
	return 0;
}