#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
#define MAX 100010
#define cout fout
vector<int> G[MAX];
queue<int> Q;

int viz[MAX];

int main(){
    int n, m, s, x, i, y, nod;
    fin >> n >> m >> s;
    while(m--){
        fin >> x >> y;
        G[x].push_back(y);
    }
    Q.push(s);
    memset(viz, -1, sizeof(viz));
    viz[s] = 0;
    while(Q.size()){
        nod = Q.front();
        Q.pop();
        for(auto v : G[nod]){
            if(viz[v] == -1){
                viz[v] = viz[nod] + 1;
                Q.push(v);
            }
        }
    }
    for(i = 1 ; i <= n ; i++){
        cout << viz[i] << " ";
    }
    cout << "\n";
}