//#include <stdio.h>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

int n,m,s,i,dist[100001],x,y,q;
vector<int> graf[100001];
queue<int> coada;
int main()
{
    /*FILE*f1,*f2;
    f1=fopen("bfs.in","r");
    f2=fopen("bfs.out","w");
    fscanf(f1,"%ld%ld%ld",&n,&m,&s);*/
    ifstream f1("bfs.in");
    ofstream f2("bfs.out");
    f1>>n>>m>>s;

    for(i=0;i<m;i++)
    {
        //fscanf(f1,"%ld%ld",&x,&y);
        f1>>x>>y;
        graf[x].push_back(y);
    }

    coada.push(s);
    /*for(i=1;i<=n;i++)
    {
        for(int j=0;j<graf[i].size();j++)
            printf("%ld ",graf[i][j]);
        printf("\n");
    }*/
    q=dist[s]=1;
    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();
        y=graf[x].size();
        for(i=0;i<y;i++)
            if(dist[graf[x][i]]==0)
            {
                coada.push(graf[x][i]);
                dist[graf[x][i]]=dist[x]+1;
            }
    }
    for(i=1;i<=n;i++)
        //fprintf(f2,"%ld ",dist[i]-1);
        f2<<dist[i]-1<<' ';

    return 0;
}