#include<iostream>
#include<stdio.h>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
long n,m,nod;
vector <int> A[100001],viz(100001,0),d(100001,-1);
queue <int> Q;
void bfs(int nod)
{
    int c=0;
    Q.push(nod);
    viz[nod]=1;
    d[nod]=0;
    while(!Q.empty())
    {
        c++;
        for(int i=0;i<A[Q.front()].size();i++)
        {
            if(viz[A[Q.front()][i]]==0)
                {
                d[A[Q.front()][i]]=d[Q.front()]+1;
                viz[A[Q.front()][i]]=1;
                Q.push(A[Q.front()][i]);
                }
        }
        Q.pop();
    }
}
int main()
{
    freopen ("bfs.in","r",stdin);
    freopen ("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&nod);
        for(int j=1;j<=m;j++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            A[x].push_back(y);
        }
/*
    for (int i=1;i<=n;i++)
    {
        cout<<i<<": ";
        for(int j=0;j<A[i].size();j++)
            cout<<A[i][j]<<" ";
        cout<<"\n";
    } */
    bfs(nod);
    for(int i=1;i<=n;i++) printf("%d ",d[i]);
    return 0;
}