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

#define Nmax 100005

using namespace std;

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

vector <int>  nr[Nmax];
queue <int>   q;
int           d[Nmax];

void BFS()
{
    int nod;
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(unsigned int i = 0; i < nr[nod].size(); i ++)
        {
            int vecin = nr[nod][i];
            if(d[vecin] == -1) //Daca nu e nodul de start sau nu a fost acolo
            {
                q.push(vecin);
                d[vecin] = d[nod] + 1; //Noua d e egala cu d unde suntem noi + 1
            }
        }
    }
}

int main()
{
    int nrVarfuri, nrMuchii, nodStart;
    fin >> nrVarfuri >> nrMuchii >> nodStart;
    for(int i = 1; i <= nrMuchii; i ++)
    {
        int x, y;
        fin >> x >> y;
        nr[x].push_back(y); //avem doar o singura directie,fiind graf orientat
    }
    for(int i = 1; i <= nrVarfuri; i ++)
        d[i] = -1; // Facem toate distantele nodurilor -1
    d[nodStart] = 0;
    q.push(nodStart); //!q.empty() pentru ca bagam nodul de start

    BFS();

    for(int i = 1; i <= nrVarfuri; i ++)
        fout << d[i] << " ";
    return 0;
}