#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <cstring>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> L[100005];
int n, m;
int viz[100005], arce[100005];
set < int > T;
void BFS(int nod)
{
    int j, x;
    sol[++sol[0]] = nod;
    viz[nod] = 1;
    T.insert(nod);
    while(T.size() > 0)
    {
        x = *T.begin();
        T.erase(*T.begin());
        for(j = 0; j < L[x].size(); j++)
            if(viz [ L[x][j] ] == 0)
            {
            T.insert(L[x][j]);
            viz[ L[x][j] ] = 1;
            sol[++sol[0]] = L[x][j];
            if(arce[L[x][j]] != -1)
            arce[L[x][j]] = arce[x] + 1;
            }
    }
    int i;
    for(i = 1; i <= n; i++)
        if(i != nod && arce[i] == 0)
        out << -1 << " ";
    else
        out << arce[i] << " ";

}

int main()
{
    int nod, i, x, y;
    in >> n >> m >> nod;
    for(i = 1; i <= m; i++)
        in >> x >> y, L[x].push_back(y);
    BFS(nod);
    return 0;
}