///parcurgere bfs
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n, m, s;
vector<int> graph[NMAX];
queue<pair<int, int>> Q;
int d[NMAX];

void init(){
    for(int i=1; i<=n; i++){
        d[i] = -1;
    }
}

void citire(){
    int x, y;
    f>>n>>m>>s;
    init();
    for(int i=0; i<m; i++){
        f>>x>>y;
        graph[x].push_back(y);
    }
}

void bfs(){
    d[s] = 0;
    Q.push({s, 0});

    while(!Q.empty()){
        int vf = Q.front().first;
        int dist = Q.front().second + 1;
        for(auto &v:graph[vf])
            if(d[v] == -1){
                Q.push({v, dist});
                d[v] = dist;
            }
        Q.pop();
    }
}

void afisare(){
    for(int i=1; i<=n; i++)
        g<<d[i]<<" ";
}

int main()
{
    citire();
    bfs();
    afisare();
    return 0;
}