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

const int NMAX=1e6;
vector <int> G[NMAX+1];
int viz[NMAX+1],d[NMAX+1];
int n,m,s;

/*
int a[NMAX+1][NMAX+1];
void CitireMatrice(){
    cin>>n>>m;
    for(int i=1;i<=m;++i) {
        int x, y;
        cin >> x >> y;
        a[x][y] = a[y][x] = 1;
    }
    //Afisare
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j) cout<<a[i][j]<<" ";
        cout<<"\n";
    }
}*/
//Fiind dat un nod S, sa se determine, pentru fiecare nod X,
// numarul minim de arce ce trebuie parcurse pentru a ajunge din nodul sursa S la nodul X.

void CitireListe(){
    fin>>n>>m>>s;
    for(int i=1;i<=m;++i){
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
}
void BFS(int x){
    queue <int> q;
    q.push(x);
    d[x]=0; viz[x]=1;
    while(!q.empty()){
        int y=q.front(); q.pop();
        for(auto next:G[y]){
            if(!viz[next]){
                q.push(next); viz[next]=1;
                d[next]=d[y]+1;
            }
        }
    }
}

void Afisare(){
    for(int i=1;i<=n;++i){
        for(auto v:G[i]) fout<<v<<" ";
        fout<<"\n";
    }
}
int main() {
    //CitireMatrice();
    CitireListe();
    BFS(s);
    for(int i=1;i<=n; i++){
        if(!d[i] && i != s)
            d[i]=-1;
        fout << d[i] << " ";
    }
    return 0;
}