#include <fstream>

using namespace std;

const int N=1e5+1;
const int M=1e6+1;

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

int vf[M], urm[M], lst[N], q[N], d[N], n, st, dr=-1, nr;

void adauga(int x, int y)
{
    vf[++nr]=y;
    urm[nr]=lst[x];
    lst[x]=nr;
}

void bfs(int x0)
{
    for(int i=1; i<=n; i++)
    {
        d[i]=-1;
    }
    d[x0]=0;
    q[++dr]=x0; ///adaug x0 in q
    while (st<=dr) ///cat timp q nu este vida
    {
        int x=q[st++]; /// scot x din q
        ///parcurg succesorii lui x
        for(int p=lst[x]; p!=0; p=urm[p])
        {
            int y=vf[p];
            if(d[y]==-1)
            {
                d[y]=d[x]+1;
                q[++dr]=y;
            }
        }
    }
}

void afis()
{
    for(int i=1; i<=n; i++)
    {
        out<<d[i]<<" ";
    }
}

int main()
{   int m, s;
    in>>n>>m>>s;
    for(int i=0; i<m; i++)
    {
        int x,y;
        in>>x>>y;
        adauga(x,y);
    }
    in.close();
    bfs(s);
    afis();
    out.close();
    return 0;
}