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

ifstream in("bfs.in");
ofstream out("bfs.out");

void bfs(int start,const vector<vector<int>>&graf,vector<int>&dist){
    queue<int>q;
    dist[start]=0;
    q.push(start);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(auto v : graf[u]){
            if(dist[v]==-1){
                dist[v]=dist[u]+1;
                q.push(v);
            }
        }
    }
}

int main(){
    int n,m,s,a,b;
    in>>n>>m>>s;
    vector<vector<int>>graf(n+1);
    vector<int>dist(n+1,-1);
    for(int i=1;i<=m;i++){
        in>>a>>b;
        graf[a].push_back(b);
    }
    bfs(s,graf,dist);
    for(int i=1;i<=n;i++){
        out<<dist[i]<<" ";
    }
}