#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>adj(100000);
int vis[100000];
int main()
{
   freopen("bfs.in","r",stdin);
  freopen("bfs.out","w",stdout);
    int n,m,s;
    cin >> n >> m >> s;
    
    for(int i =0;i<n;i++){
        vis[i] = -1;
    }
    
    for(int i = 0;i<m;i++){
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].push_back(b);
    }
    
    queue<int>q;
    vis[s-1] = 0;
    
    q.push(s-1);
    
    while(q.size()){
        int nod = q.front();
        q.pop();
        for(auto v : adj[nod]){
            if(vis[v] == -1){
                vis[v] = vis[nod]+1;
                q.push(v);
            }
        }
    }
    
    for(int i = 0;i<n;i++) cout<<vis[i]<<" ";
    
    
   

    return 0;
}