#include<bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> graph[100001];
int visited[100001];
int distances[100001];

int main()
{
    int n,m,x,y,i,curr,it,s;
    fin>>n>>m>>s;
    for(i=0;i<m;i++){
        fin>>x>>y;
        graph[x].push_back(y);
    }
    queue<int>q;
    q.push(s);
    visited[s] = 1;
    while(!q.empty()){
        curr = q.front();
        q.pop();
        for(auto it:graph[curr]){
            if(!visited[it]){
                distances[it] = distances[curr] + 1;
                q.push(it);
                visited[it] = 1;
                }
            }
        }
    for(i=1;i<=n;i++){
        if(distances[i] == 0){
            distances[i] = -1;
        }
    }
    distances[s] = 0;
    for(i=1;i<=n;i++){
        cout<<distances[i]<<" ";
    }
    return 0;
}