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

using namespace std;

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

const int NMAX = 1e5 + 5;

vector<int> G[NMAX];
int cost[NMAX];

void bfs(int nod){
    queue<int> q;
    q.push(nod);
    cost[nod] = 0;
    while(!q.empty()){
        int nod_curent = q.front();
        q.pop();
        for (int i = 0; i < G[nod_curent].size(); i ++){
            int nod_nou = G[nod_curent][i];
            if(cost[nod_nou] == -1){
                cost[nod_nou] = cost[nod_curent] + 1;
                q.push(nod_nou);
            }
        }
    }
}

int main (){

    int N, M, S;
    fin >> N >> M >> S;
    while(M--){
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= N; i ++){
        cost[i] = -1;
    }
    bfs(S);
    for (int i = 1; i <= N; i++) {
        fout << cost[i] << " ";
    }
}