#include <iostream>
#include <fstream>
#include <vector>
using  namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> graph[100005];
int viz[100005], lungime[100005];
int n, m, s;

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

int main() {
    citire();
    int coada[100005], st, dr;

    for(int i = 1; i <= n; i ++)
        lungime[i] = -1;

    st = dr = 1;
    coada[st] = s;
    viz[s] = 1;
    lungime[s] = 0;
    while(st <= dr){
        int el_curent = coada[st];
        int lim = graph[el_curent].size();
        for(int i  = 0; i < lim; i ++){
            int vecin = graph[el_curent][i];
            if(!viz[vecin])
            {
                viz[vecin] = 1;
                coada[++dr] = vecin;
                lungime[vecin] = lungime[el_curent] + 1;
            }
        }
        st ++;
    }

    for(int i = 1; i <= n; i ++)
        g<< lungime[i] << ' ';

    return 0;
}