#include <queue>
#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>

using namespace std;

const int oo=1<<29;
const int N_MAX=100011;

int d[N_MAX];
queue<int> Q;
vector<int> G[N_MAX];
vector<int>::const_iterator it, iend;

int main()
{
    int N, M, s, x, y;
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    for(in>>N>>M>>s; M; --M)
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    fill(d+1, d+N+1, -1);
    for(d[s]=0, Q.push(s); !Q.empty(); Q.pop())
    {
        x=Q.front();
        for(it=G[x].begin(), iend=G[x].end(); it < iend; ++it)
            if(-1 == d[*it])
            {
                d[*it]=d[x]+1;
                Q.push(*it);
            }
    }
    copy(d+1, d+N+1, ostream_iterator<int>(out, " "));

    return EXIT_SUCCESS;
}