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

using namespace std;

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

int n,m,s,a,b;

vector<vector<int>> v(100005);
vector<int> dist(n+1);
queue<int> q;


void bfs(int src){

    q.push(src);
    dist[src]=0;
    while(!q.empty()){
        int node=q.front();
        q.pop();
        for(auto i:v[node]){
            if(dist[i]==-1){
                dist[i]=dist[node]+1;
                q.push(i);
            }
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        fin>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++){
        dist[i]=-1;
    }
    bfs(s);
    for(int i=1;i<=n;i++){
        fout<<dist[i]<<" ";
    }
    return 0;
}