# include <cstdio>
# include <queue>
# include <bitset>
using namespace std;
int n,m,s,i,viz[100001],x,y;
queue <int>q;
bitset <15001>G[15001];
void bfs(int x)
{
    int i;
    q.push(x);viz[x]=1;
    while(!q.empty())
    {
        x=q.front(); q.pop();
        for(i=1;i<=n;++i)
        {
            if(G[x][i]==1 && viz[i]==0)
            {
                q.push(i);
                viz[i]=viz[x]+1;
            }
        }
    }
}
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);
        G[x][y]=1;
    }
    bfs(s);
    for(i=1;i<=n;++i)
        printf("%d ",viz[i]-1);
    printf("\n");
    return 0;
}