#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<vector<int>> citire_graf(int n, int m){
    vector<vector<int>> adj(n+1);
    while(m--){
        int a,b;
        fin >> a >> b;
        adj[a].push_back(b);
    }
    return adj;
}
void bfs(vector<int> &dist, int start, vector<vector<int>> &adj){
    queue<int> q;
    int n = adj.size();
    dist.assign(n, -1);
    vector<bool> viz(n);
    viz[start] = 1;
    dist[start] = 0;
    q.push(start);
    while(!q.empty()){
        int front = q.front();
        q.pop();
        for(int vecin : adj[front]){
            if(!viz[vecin]){
                q.push(vecin);
                viz[vecin] = 1;
                dist[vecin] = dist[front]+1;
            }
        }
    }
}
int main(){
    int n,m,s;
    fin >> n >> m >> s;
    vector<vector<int>> adj(n+1);
    adj = citire_graf(n,m);
    vector<int> dist(n+1);
    bfs(dist, s, adj);
    for(int i = 1; i<=n; i++){
        fout << dist[i] << ' ';
    }

    return 0;
}