#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")

using namespace std;

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

const int MAX_N = 100005;
int n, m, s, x, y;
int minimum_distance[MAX_N];
vector <int> edge[MAX_N];

void bfs(int start){
    int nod;
    queue <int> q;

    for(int i=1; i<=n; i++)
        if(start != i)
            minimum_distance[i] = -1;

    q.push(start);
    while(!q.empty()){
        nod = q.front();
        q.pop();

        for(auto vecin : edge[nod]){
            if(minimum_distance[vecin] == -1){
                minimum_distance[vecin] = minimum_distance[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main (){
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr), fout.tie(nullptr);

    fin>>n>>m>>s;
    for(int e=1; e<=m; e++){
        fin>>x>>y;
        edge[x].push_back(y);
    }

    bfs(s);
    for(int i=1; i<=n; i++)
        fout<<minimum_distance[i]<<" ";
    return 0;
}