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

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

void solve(){
    int n,m,s;
    int x,y;
    vector<vector<int>>D(n+1);
    vector<int>dist(n+1,-1);
    queue<int>q;
    in>>n>>m>>s;
    for(int i=0;i<m;i++){
        in>>x>>y;
        D[x].push_back(y);
    }
    dist[s]=0;
    q.push(s);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int v:D[u]){
            if(dist[v]==-1){
                dist[v]=dist[u]+1;
                q.push(v);
            }
        }
    }
    for(int i=1;i<=n;i++){
        out<<dist[i]<<" ";
    }
    out<<"\n";
}

int main(){
    solve();
    return 0;
}