#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int main()
{
    int n,m,s;
    f>>n>>m>>s;
    vector<vector<int>>adj(n+1);
    for(int i=1;i<=m;i++){
        int u,v;
        f>>u>>v;
        adj[u].push_back(v);
    }
    vector<int>dist(n+1,-1);
    queue<int>q;
    dist[s]=0;
    q.push(s);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int v:adj[u]){
            if(dist[v]==-1){
                dist[v]=dist[u]+1;
                q.push(v);
            }
        }
    }
    for(int i=1;i<=n;i++){
        g<<dist[i]<<" ";
    }
    return 0;
}