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

using namespace std;

const int nMax=100005;
int n , m , x , y , rez , start;
vector <int> a[nMax];
int distanta[nMax];
queue <int> coada;

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

void bfs()
{
    int n , vec;
    while(!coada.empty()){
        n=coada.front();
        coada.pop();
        for(size_t i=0;i<a[n].size();i++){
            vec=a[n][i];
            if(distanta[vec]==-1){
                distanta[vec]=distanta[n]+1;
                coada.push(vec);
            }
        }
    }
}

int main()
{
    f >> n >> m >> start;
    for(int i=1;i<=m;i++){
        f >> x >> y;
        a[x].push_back(y);
    }
    for(int i=1;i<=n;i++){
        distanta[i]=-1;
    }
    coada.push(start);
    distanta[start]=0;
    bfs();
    for(int i=1;i<=n;i++) g << distanta[i] << " ";
}