#include <iostream>
#include <fstream>
#include <cstring>
#include <queue>
#define MAX 100002
using namespace std;
int n,m,s,x,y,dist[MAX];
vector<int> v[MAX];

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

void bfs(int nod){
    queue<int> coada;
    coada.push(nod);
    dist[nod] = 0;
    while(!coada.empty()){
        nod = coada.front();
        for(auto vecin : v[nod]){
            if(dist[vecin] == -1){
                dist[vecin] = 1+dist[nod];
                coada.push(vecin);
            }
        }
        coada.pop();
    }
}

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