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

using namespace std;

const int MAXN = 100005;

vector<int> adj[MAXN];
int visited[MAXN];
int N, M, S;

void bfs(int node) {
    visited[node] = 0;
    queue<int> Q;
    Q.push(node);
    while(!Q.empty()){
        int node = Q.front();
        for(int i = 0; i < adj[node].size(); i++) {
            int neighbour = adj[node][i];
            if(visited[neighbour] == -1) {
                visited[neighbour] = visited[node] + 1;
                Q.push(neighbour);
            }
        }
        Q.pop();
    }
}
int main() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    fin >> N >> M >> S;
    for (int i = 0; i < M; ++i) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    for(int i = 0;i<=N;i++) {
        visited[i] = -1;
    }
    bfs(S);
    for(int i = 1; i<=N;i++){
        fout<<visited[i]<<' ';
    }
    return 0;
}