#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n,m,st;
int D[100005];
vector<int> L[100005];

void read(){
    in>>n>>m>>st;
    for(int i=1,x,y;i<=m;i++){
        in>>x>>y;
        L[x].push_back(y);
    }
}
void bfs(int nod){
    queue<int> Q;
    Q.push(nod);
    while(!Q.empty()){
        int nod=Q.front();
        Q.pop();
        for(auto x : L[nod])
            if(!D[x]){
                D[x]=D[nod]+1;
                Q.push(x);
            }
    }
}
void solve(){
    D[st]=1;
    bfs(st);
    for(int i=1;i<=n;i++)
        out<<D[i]-1<<" ";
}
int main(){
    read();
    solve();
    return 0;
}