#include <bits/stdc++.h>
using namespace std;

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

int n, m, s;
vector<int> L[500005];
int d[500005];

void BFS(int s){
    queue<int> Q;
    for(int i = 1; i <= n; i++)
        d[i] = 1e9;
    d[s] = 0;
    Q.push(s);
    while(!Q.empty()){
        int nod = Q.front();
        Q.pop();
        for(int i = 0; i < L[nod].size(); i++){
            int vecin = L[nod][i];
            if(d[vecin] > d[nod] + 1){
                d[vecin] = d[nod] + 1;
                Q.push(vecin);
            }
        }
    }
}

int main(){
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
    }
    BFS(s);
    for(int i = 1; i <= n; i++){
        if(d[i] == 1e9)
            fout << -1 << " ";
        else
            fout << d[i] << " ";
    }
}