#include <queue>
#include <fstream>
#define NMAX 100000
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s;
vector <int>Edge[NMAX];
queue<int>coada;
int Distanta[NMAX];
void citire()
{
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        Edge[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        Distanta[i] = -1;
    Distanta[s] = 0;
    coada.push(s);
    
}

void bfs()
{
    int Nod,Vecin;
    while (!coada.empty()) {
        Nod=coada.front();
        coada.pop();
        for(int k=0;k<Edge[Nod].size();k++)
        {
            //cout<<"EDGESIZE= "<<Edge[Nod].size()<<endl;
            Vecin=Edge[Nod][k];
            if(Distanta[Vecin]==-1)
               {
                   coada.push(Vecin);
                   Distanta[Vecin]=Distanta[Nod] + 1;
               }
            
        }
                            }
    
}
int main()
{
    citire();
    bfs();
    for(int i=1;i<=n;i++)
        out<<Distanta[i]<<" ";
    
    return 0;
    
    
}