#include <bits/stdc++.h>
const int NMAX=1e5+1;
using namespace std;
vector <int> g[NMAX+1];
queue <int> c;
int d[NMAX+1],viz[NMAX+1];
int main(){
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n,m,e,x,y;
    fin>>n>>m>>e;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
    c.push(e);
    viz[e]=1;
    while(!c.empty()){
        int x=c.front();
        for(int y:g[x]){
            if(!viz[y]){
                viz[y]=1;
                d[y]=d[x]+1;
                c.push(y);
            }
        }
        c.pop();
    }
    for(int i=1;i<=n;i++){
        if(!viz[i]){
            fout<<"-1 ";
        }
        else{
            fout<<d[i]<<" ";
        }
    }
    return 0;
}