#include <bits/stdc++.h>

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

int n, m, s;
vector<int> graf[100000];
bool viz[100000];
int dist[100000];
queue<int> q;


void bfs(int s){
    viz[s] = true;
    q.push(s);

    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(int j=0; j<graf[nod].size(); j++){
            if(viz[graf[nod][j]] == false){
                q.push(graf[nod][j]);
                viz[graf[nod][j]] = true;
                dist[graf[nod][j]] = 1 + dist[nod];
            }
        }
    }
}

int main(){
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++){
        int x, y;
        fin>>x>>y;
        graf[x].push_back(y);
    }

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

    dist[s] = 0;

    bfs(s);
/*
    for(int i=1; i<=n; i++){
        cout<<i<<": ";
        for(int j=0; j<graf[i].size(); j++){
            cout<<graf[i][j]<<' ';
        }
    cout<<endl;
    }
*/
    for(int i=1; i<=n; i++){
        cout<<dist[i]<<' ';
    }
}