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

using namespace std;

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

const int NMAX = 100001;

int n, m, NodStart;
int distante[NMAX];

vector <int > muchii[NMAX];
queue <int > coada;

void bfs()
{
    for (int i=1;i<=n;i++)
        distante[i] = -1;
    distante[NodStart] = 0;
    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 (distante[vecin] == -1)
            {
                coada.push(vecin);
                distante[vecin] = distante[nod] + 1;
            }
        }
    }
}

void citire()
{
    fin >> n >> m >>NodStart;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }
    coada.push(NodStart);
    bfs();
}

void afiseaza()
{
    for (int i=1;i<=n;i++)
        fout << distante[i] << " ";
}

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