#include <iostream>
#include <vector>
#include <string.h>
#include <fstream>
#define nmax 100005

using namespace std;

vector <int> G[nmax];
int C[nmax], S[nmax], Dist[nmax];
int n, m, s, L;

void build(){
    int x, y;
    ifstream f("bfs.in");
    f >> n >> m >> s;
    for(int i=1; i<=m; i++){
        f >> x >> y;
        G[x].push_back(y);
    }
}

void bfs(int start){
    int i, j;
    memset(Dist, -1, sizeof(Dist));
    L = 1;
    Dist[start] = 0;
    S[L] = start;
    for(i=1; i<=L; i++)
        for(j=0; j < G[S[i]].size(); j++)
            if(Dist[G[S[i]][j]] == -1){
                L++;
                S[L] = G[S[i]][j];
                Dist[S[L]] = Dist[S[i]] + 1;
            }
}

int main()
{
    build();
    ofstream g("bfs.out");
    for(int i=1; i<=n; i++)
        C[i] = G[i].size();
    bfs(s);
    for(int i=1; i<=n; i++)
        g << Dist[i] << " ";
    return 0;
}