#include<fstream>
#include<queue>
using namespace std;

int n,m,s,i,x,y;
int viz[100005],d[100005];
struct coada
{
    int x,d;
};
queue <coada> q;

struct nd
{
    int x;
    nd *urm;
};
nd *gr[100005],*r;

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

void adaug(int x,int y)
{
    nd *p=new nd;
    p->x=y;
    p->urm=gr[x];
    gr[x]=p;
}

void bfs(int vf)
{
    q.push({vf,0});
    coada nod;
    for(int i=1;i<=n;i++)
        d[i]=-1;
    d[vf]=0;
    viz[vf]=1;
    while(!q.empty())
    {
        nod=q.front();
        for(r=gr[nod.x];r!=NULL;r=r->urm)
        {
            if(viz[r->x]==0)
            {
                viz[r->x]=1;
                d[r->x]=nod.d+1;
                q.push({r->x,nod.d+1});
            }
        }
        q.pop();
    }
    for(int i=1;i<=n;i++)
        g<<d[i]<<" ";
}

int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        adaug(x,y);
    }
    bfs(s);
    f.close();
    g.close();
    return 0;
}