#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
#define NMAX 100005
using namespace std;

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

vector <int> A[NMAX];
queue <int> Q;
int n, m, x, viz[NMAX];

void citire(){
    fin>>n>>m>>x;
    for(; m; m--){
        int i, j; fin>>i>>j;
        A[i].pb(j);
    }
}

void BFS(int x){
    viz[x] = 1;
    Q.push(x);
    while(!Q.empty()){
        int K = Q.front();
        Q.pop();
        for(int i=0; i<A[K].size(); i++){
            int T = A[K][i];
            if(!viz[T]){
                viz[T] = viz[K] + 1;
                Q.push(T);
            }
        }
    }

}


int main(){
    citire();
    BFS(x);

    for(int i=1; i<=n; i++){
        fout<<viz[i]-1<<' ';
    }


    return 0;
}