#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
const int NMAX=100000;
using namespace std;
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
queue<int>q;
vector <int>G[NMAX+5],d;
vector<bool>viz;
int n;
void bfs(int u)
{
    int v,j;
    viz.assign(n+1,0);
    d.assign(n+1,0);
    q.push(u);
    viz[u]=1;
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(j=0;j<G[u].size();j++)
        {
            v=G[u][j];
            if(viz[v]==0)
            {
                viz[v]=1;
                d[v]=d[u]+1;
                q.push(v);
            }
        }
    }
}
int main()
{
    int m,s,i,u,v;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        if(d[i]==0 && i!=s) d[i]=-1;
    for(i=1;i<=n;i++)
        printf("%d ",d[i]);
    return 0;
}