#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define nmax 100005
using namespace std;

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

vector <int> v[nmax];
queue <int> my_queue;

int nr_of_nodes, nr_of_edges, source;
int dist[nmax];

void bfs(int s){
    for(int i=1; i<=nr_of_nodes; i++) dist[i]= -1;
    dist[s]= 0;
    my_queue.push(s);
    while(!my_queue.empty()){
        int current= my_queue.front();
        for(int i=0; i<v[current].size(); i++)
            if(dist[v[current][i]]== -1){
                dist[v[current][i]]= dist[current]+1;
                my_queue.push(v[current][i]);
            }
        my_queue.pop();
    }
    for(int i=1; i<=nr_of_nodes; i++) fout << dist[i] << " ";
}

int main(){
    int x, y;
    fin >> nr_of_nodes >> nr_of_edges >> source;
    for(int i=1; i<=nr_of_edges; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }
    bfs(source);
    return 0;
}