#include<cstdio>
#include<deque>
#include<vector>
using namespace std;
#define N 100002
int u[N];
vector<int> v[N];
deque<int> q;

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,x,y,i,j,s;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=0;i<=n;i++)
        u[i]=-1;
    q.push_back(s);
    u[s]=0;
    while(!q.empty())
    {
        for(i=0;i<v[q[0]].size();i++)
        {
            if(u[v[q[0]][i]]==-1)
            {
                q.push_back(v[q[0]][i]);
                u[v[q[0]][i]]=u[q[0]]+1;
            }
        }
        q.pop_front();
    }
    for(i=1;i<=n;i++)
        printf("%d ",u[i]);
    return 0;
}