#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> lista[100001];
int coada[100001],dist[100001];
int main ()
{
    int n,m,s,i,x,y,st,dr,nod;
    fin>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        lista[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        dist[i]=-1;
    st=dr=1;
    coada[1]=s;
    dist[s]=0;
    while (st<=dr)
    {
        nod=coada[st];
        for (i=0;i<lista[nod].size();i++)
            if (dist[lista[nod][i]]==-1)
            {
                dr++;
                coada[dr]=lista[nod][i];
                dist[lista[nod][i]]=dist[nod]+1;
            }
        st++;
    }
    for (i=1;i<=n;i++)
        fout<<dist[i]<<" ";
    return 0;
}