#include <iostream>
#include <fstream>
#include <queue>
#define NMAX 100
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n, m, s, i, j, x, y, a[NMAX][NMAX], v[NMAX], d[NMAX];
void read(){
    in>>n>>m>>s;
    for(i=1; i<=m; i++){
        in>>x>>y;
        a[x][y]=1;
    }
}

void bfs(){
    queue<int> q;
    int node=s;
    v[node]=1;
    q.push(node);
    while(!q.empty()){
        node=q.front();
        q.pop();
        for(j=1; j<=n; j++){
            if(a[node][j]==1&&v[j]==0){
                q.push(j);
                v[j]=1;
                d[j]=d[node]+1;
            }
        }
    }
    for(i=1; i<=n; i++){
        if(v[i]==1)out<<d[i]<<" ";
        else out<<-1<<" ";
    }
}

int main(){
    read();
    bfs();
    return 0;
}