#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,start,inc,sf,i;
vector<int> a[NMAX];
int C[NMAX];
int viz[NMAX]; //0 daca nu a fost vizitat, respectiv nr de varfuri de pe cel mai scurt drum de la start la i
void citire();
void bfs(int x);
int main()
{
    citire();
    bfs(start);
    for(i=1; i<=n; i++) cout<<viz[i]-1<<' ';
    fout.close();
    return 0;
}
void citire()
{int k,i,j,m;
    fin>>n>>m>>start;
    for(k=0; k<m; k++)
    {
        fin>>i>>j;
        //yintra in lista de adiacenta a lui x
        a[i].push_back(j);
    }
}
void bfs(int x)
{int i;
    viz[x]=1;
    C[1]=x; inc=sf=1; //luca0001
    while(inc<=sf)
    {
        x=C[inc++];
        for(i=0; i<a[x].size(); i++)
            if(!viz[a[x][i]])
            {   viz[a[x][i]]=1+viz[x];
                C[++sf]=a[x][i];
            }
    }
}