#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int Nmax = 100005;

int n, m, S;
vector<int> L[Nmax], dist(Nmax, -1);
queue<int> Q;

void bfs(){
    while(!Q.empty()){
        int nod = Q.front();
        Q.pop();
        for(int vec : L[nod]){
            if(dist[vec] > dist[nod] + 1 || dist[vec] == -1){
                dist[vec] = dist[nod] + 1;
                Q.push(vec);
            }
        }
    }
}

int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin >> n >> m >> S;
    while(m--){
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
    }
    dist[S] = 0;
    Q.push(S);
    bfs();
    for(int i = 1; i <= n; i++){
        fout << dist[i] << ' ';
    }

    return 0;
}