#include <cstdio>
#include <vector>
using namespace std;


vector <int> a[100005];

int coada[110000],viz[100005],g[110000],prim,ultim,x,y,n,m,vfi;

void dfs(int vf)
{
    if(prim==ultim)
        return;
    for(int i=0;i<g[vf];i++)
    {
        if(viz[a[vf][i]]==-1)
        {
            viz[a[vf][i]]=viz[vf]+1;
            coada[ultim]=a[vf][i];
            ultim++;
        }
    }
    prim++;
    dfs(coada[prim]);
}


int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&vfi);
    for(int i=1;i<=n;i++)
    {
        viz[i]=-1;
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
        g[x]++;
    }
    viz[vfi]=0;
    ultim=1;
    prim=0;
    dfs(vfi);
    for(int i=1;i<=n;i++)
    {
        printf("%d ",viz[i]);
    }
    return 0;
}