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

int d[100005],c[100005],n,m,s;
vector <int> vec[100005];

void dfs ()
{
    int i,st,dr;
    for (i=1; i<=n; i++)
        d[i]=-1;
    d[s]=0;
    c[1]=s;
    st=1; dr=1;
    while (st<=dr)
    {
        for (i=0; i<vec[c[st]].size(); i++)
            if (d[vec[c[st]][i]]==-1)
            {
                d[vec[c[st]][i]]=d[c[st]]+1;
                c[++dr]=vec[c[st]][i];
            }
        st++;
    }
}

int main ()
{
    int i,x,y;
    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);
        vec[x].push_back(y);
    }
    dfs();
    for (i=1; i<=n; i++)
        printf("%d ",d[i]);
    return 0;
}