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

using namespace std;

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

int n, m, s;
const int NMAX = 100001;

int distanta[NMAX];
vector <int> Muchii[NMAX];
queue <int> coada;

void bfs()
{
    int nod, vecin;
    while (!coada.empty())
    {
        nod = coada.front();
        coada.pop();
        for (unsigned int i = 0; i < Muchii[nod].size(); ++i)
        {
            vecin = Muchii[nod][i];
            if (distanta[vecin] == -1)
            {
                coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
    }
}

void citire()
{
    int x, y;
    in >> n >> m >> s;
    for (int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        Muchii[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        distanta[i] = -1;
    distanta[s] = 0;
    coada.push(s);
    bfs();
    for (int i = 1; i <= n; ++i)
        out << distanta[i] << " ";
}

int main()
{
    citire();
    return 0;
}