#include <bits/stdc++.h>
std::fstream fin("bfs.in");
std::ofstream fout("bfs.out");

void bfs(std::vector<std::vector<int>>& adj,std::vector<int>& dist,int src){
    std::queue<int> q;
    dist[src]=0;
    q.push(src);
    while(!q.empty()){
        int node=q.front();
        q.pop();
        for(auto x:adj[node]){
            if(dist[x]==-1){
                dist[x]=dist[node]+1;
                q.push(x);
            }
        }
    }
}

int main(){
    int n,m,src;
    fin>>n>>m;
    fin>>src;
    std::vector<std::vector<int>> adj(n+1);
    std::vector<int> dist(n+1,-1);
    for(int i=0;i<m;i++){
        int x,y;
        fin>>x>>y;
        adj[x].push_back(y);
    }
    bfs(adj,dist,src);
    dist.erase(dist.begin(),dist.begin()+1);
    for(auto &x:dist){
        fout<<x<<" ";
    }
    fout<<"\n";
    fin.close();
    fout.close();
    return 0;
}