#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;

int main(){
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> adj(n + 1);
    for(int i = 0; i < m; i++){
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }

    vector<int> dist(n + 1, -1);
    queue<int> q;

    dist[s] = 0;
    q.push(s);

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

        for(int vecin : adj[nod]){
            if(dist[vecin] == -1){
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }

    for(int i = 1; i <= n; i++){
        fout << dist[i] << " ";
    }
    return 0;
}