#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> A[100001];
vector <int> :: iterator it;
queue <int> Q;
int N,M,S;
int VIZ[100001], C[100001];
void bfs(int s){
    int x, i;
    Q.push(s);
    while(!Q.empty()){
        x = Q.front();
        Q.pop();
        VIZ[x] = 1;
        for(it = A[x].begin(); it < A[x].end(); it++)
            if(VIZ[(*it)] == 0){
                C[(*it)] = C[x] + 1;
                Q.push(*it);
            }
    }
    for( i = 1; i <= N; i++ )
        if(C[i] == 0 && i != s)
            g << -1 << " ";
        else
            g << C[i] << " ";
}

int main()
{
    int i, x, y;
    f >> N >> M >> S;
    for( i = 1; i <= M; i++ ){
        f >> x >> y;
        A[x].push_back(y);
    }
    bfs(S);
    return 0;
}