#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
vector<int> v[100005];
int d[100005];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int s,u,n,m,i,a,b;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
    }
    queue<int> q;
    for(i=1;i<=n;i++) d[i]=-1;
    q.push(s);d[s]=0;
    while(!q.empty())
    {
        u=q.front();
        vector<int>::iterator it;
        for(it=v[u].begin();it!=v[u].end();it++)
            if(d[*it]==-1)
            {
                d[*it]=d[u]+1;
                q.push(*it);
            }
        q.pop();
    }
    for(i=1;i<=n;i++)
        printf("%d ",d[i]);
    printf("\n");
    return 0;
}