#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

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

const int Nmax = 100010;

vector<int> v[Nmax];
int N,M,S,a,b;
int dist[Nmax];

queue<int> q;

int main()
{
    f>>N>>M>>S;
    for(;M;M--){
        f>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=N;i++)
        dist[i]=-1;
    q.push(S);
    dist[S]=0;
    while(q.size()){
        int node = q.front();
        q.pop();
        for(auto it:v[node])
            if(dist[it] == -1){
                dist[it] = dist[node] + 1;
                q.push(it);
            }
    }
    for(int i=1;i<=N;i++)
        g<<dist[i]<<' ';
    return 0;
}