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

using namespace std;

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

vector<int>G[100003];
queue<int>Q;
int n,m,s,l[100003];

void citire(){
    f>>n>>m>>s;
    int x,y;
    for(int i=0; i<m; i++){
        f>>x>>y;
        G[x].push_back(y);
    }

}

void BFS(int start){
    int viz[100003]={0};
    l[start]=0;
    Q.push(start);
    viz[start]=1;
    while (!Q.empty()){
        int nod=Q.front();
        Q.pop();
        for(auto &v:G[nod]){
            if(!viz[v]){
                l[v]=l[nod]+1;
                viz[v]=1;
                Q.push(v);
            }
        }
    }
    for(int i=1; i<=n; i++)
        if(i==s)
            g<<0<<" ";
        else if(l[i]==0)
            g<<-1<<" ";
        else
            g<<l[i]<<" ";
}

int main() {
    citire();
    BFS(s);
    return 0;
}