#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <iostream>
using namespace std;


const int kNmax = 100005;

int main(){
    int n;
	int m;
    int x,y;
	int source;
	vector<int> adj[kNmax];
    ifstream fin("bfs.in");
		fin >> n >> m >> source;
		for (int i = 1; i <= m; i++) {
			fin >> x >> y;
			adj[x].push_back(y);
		}
	fin.close();
    vector<int> d(n + 1);
    bool *visited = new bool[kNmax];
    for(int i = 1; i <= n; i++) {
        visited[i] = false;
    }
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        d[i] = -1;
    }
    q.push(source);
    d[source] = 0;

    while(!q.empty()) {
        int node = q.front();
        visited[node] = true;
        q.pop();
        for(int neighbor : adj[node]) {
            if(visited[neighbor] == false) {
                d[neighbor] = d[node] + 1;
                visited[neighbor] = true;
                q.push(neighbor);
            }
        }
    }
    ofstream fout("bfs.out");
    for(int i = 1; i<=n ;i++){
        fout<<d[i]<<" ";
    }
    fout.close();
}