#include <bits/stdc++.h>
using namespace std;
int viz[100005],i,m,n,nr,x,y,s;
vector <int> v[100005];
void dfs(int nod)
{
    int i;
    for(i=0;i<v[nod].size();i++)
        if(viz[v[nod][i]]==-1)
        {
            viz[v[nod][i]]=viz[nod]+1;
            dfs(v[nod][i]);
        }
}
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);
       if(x!=y) v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        viz[i]=-1;
    viz[s]=0;
    dfs(s);
    for(i=1;i<=n;i++)
        printf("%d ",viz[i]);
    return 0;
}