#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");



int main(){
    int n,m,s;
    f >> n;
    f >> m;
    f >> s;
    vector<vector<int>> adj(n+1);

    
    
    for (int i = 1; i<=m;i++){
        int x,y;
        f >> x >> y;
        adj[x].push_back(y);
    }
    vector<int> dist(n+1,-1);
    queue<int> q;
    dist[s] = 0;
    q.push(s);
    while(!q.empty()){
        int top = q.front();
        q.pop();

        for(int neigh : adj[top]){
            if(dist[neigh] ==-1){
                dist[neigh] = dist[top] +1;
                q.push(neigh);
            }
        }
    }
    for(int i=1;i<=n;i++){
        g << dist[i] << " ";
    }

    f.close();
    g.close();

    return 0;
}