#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m, start, d[100005];
vector <int> v[100005];
queue <int> q;

void BFS(){
    int nod, vec;

    while(!q.empty()){
        nod = q.front();
        q.pop();

        for(int i = 0; i < v[nod].size(); i++){
            vec = v[nod][i];

            if(d[vec] == -1){
                q.push(vec);
                d[vec] = d[nod] + 1;
            }
        }
    }
}

void citire(){
    in >> n >> m >> start;

    for(int i = 1; i <= m; i++){
        int x, y;

        in >> x >> y;

        v[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        d[i] = -1;

    q.push(start);
    d[start] = 0;
    BFS();
}

void afis(){
    for(int i = 1; i <= n; i++)
        out << d[i] << " ";
}

int main()
{
    citire();
    afis();

    return 0;
}