#include <bits/stdc++.h>
using namespace std;
int dist[100005],coada[100005],i,m,n,s,p,u,x,y,nod;
vector <int> v[100005];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        dist[i]=-1;
    p=u=1;
    coada[1]=s;
    dist[s]=0;
    while(p<=u)
    {
        nod=coada[p];
        p++;
        for(i=0;i<v[nod].size();i++)
        {
            if(dist[v[nod][i]]==-1)
            {
                dist[v[nod][i]]=dist[nod]+1;
                u++;
                coada[u]=v[nod][i];
            }
        }
    }
    for(i=1;i<=n;i++)
        printf("%d ",dist[i]);
    return 0;
}