//Refacem algoritmul de "breadth first search" pt. a vedea daca il mai stim
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n,m,nod_start;
vector <int> v[100010];
vector<int>::iterator it;
queue <int> coada;
int a[1000010];

void bfs()
{
    int aux,x;
    coada.push(nod_start);
    while(!coada.empty())
    {
        x = coada.front();
        aux = a[x];
        for(it = v[x].begin(); it < v[x].end(); it++)
        {
            if(a[*it] == -1)
            {
                a[*it] = aux+1;
                coada.push(*it);
            }
        }
        coada.pop();
    }
}

void afish_rapsuns()
{
    for(int i=1;i<=n;i++)
    {
        if(i==nod_start) w<<"0 ";
        else if(a[i]==-1) w<<"-1 ";
            else w<<a[i]+1<<" ";
    }
}

int main()
{int x,y;
    q>>n>>m>>nod_start;

    for(int i=1;i<=m;i++) a[i]=-1; //Initializam toate nodurile cu imposibilitatea de a le atinge.
    for(int i=1;i<=m;i++)
    {
        q>>x>>y;
        v[x].push_back(y);
    }
    bfs();
    afish_rapsuns();


    return 0;
}