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

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

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));
    deque<int> cd;
    cd.push_back(s);
    vf[s] = 1;
    dist[s] = 0;
    while(!cd.empty()){
        int nod = cd.back();
        cd.pop_back();
        for(auto fiu: v[nod]){
            if(vf[fiu] == 0){
                vf[fiu] = 1;
                dist[fiu] = 1+dist[nod];
                cd.push_front(fiu);
            }
        }
    }
    for(int i = 1; i <= n; i++){
        fout << dist[i] << " ";
    }
    return 0;
}