#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int N_MAX = 1e5 + 2;
int N, M, S;
vector <int> G[N_MAX];
queue <int> q;
int Dist[N_MAX];

void BFS (int node){
    q.push(node);
    Dist[node] = 1;
    while (!q.empty()){
        node = q.front();
        q.pop();
        for (int j = 0; j < (int)G[node].size(); j++)
            if (!Dist[G[node][j]]){
                Dist[G[node][j]] = Dist[node] + 1;
                q.push(G[node][j]);
            }
    }
    for (int i = 1; i <= N; i++)
        out << Dist[i] - 1 << " ";
}

int main(){
    in >> N >> M >> S;
    int x, y;
    for (int i = 1; i <= M; i++){
        in >> x >> y;
        G[x].push_back(y);
    }
    BFS(S);
    return 0;
}