#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX=1e5;
vector<int> mat[NMAX+5];
vector<int> dist(NMAX+5, -1);
int n, m, s;
void bfs(){
    dist[s]=0;
    queue<int> q;
    q.push(s);
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto it:mat[nod]){
            if(dist[it]==-1 or dist[it]>dist[nod]+1){
                dist[it]=dist[nod]+1;
                q.push(it);
            }
        }
    }
}
int main(){
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        int x, y;
        fin>>x>>y;
        mat[x].push_back(y);
    }
    bfs();
    for(int i=1;i<=n;i++){
        fout<<dist[i]<<' ';
    }
}