#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define nmax 100005

using namespace std;

int n, m, s, d[nmax], viz[nmax];
vector <int> G[nmax];
queue <int> Q;

void read(){
    int x, y;
    ifstream f("bfs.in");
    f >> n >> m >> s;
    for(int i=1; i<=m; i++){
        f >> x >> y;
        G[x].push_back(y);
        //G[y].push_back(x);
    }

}

void setd(int st){
    for(int i=1; i<=n; i++)
        d[i] = -1;
    d[st] = 0;
}


void bfs(int st){
    int nod, v;
    Q.push(st);
    viz[st] = 1;
    while(!Q.empty()){
        nod = Q.front();
        Q.pop();
        for(int i=0; i<G[nod].size(); i++){
            v = G[nod][i];
            if(d[v] == -1){
                d[v] = d[nod] + 1;
                viz[v] = 1;
                Q.push(v);
            }
        }
    }
}

int main()
{
    read();

    setd(s);
    bfs(s);

    ofstream g("bfs.out");
    for(int i=1; i<=n; i++)
        g << d[i] << " ";
    return 0;
}