#include <iostream>
#include <fstream>
#include <stdio.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#define NMax 100001
using namespace std;
vector<int> Graf[NMax];
queue<int> Q;
int d[NMax],N,M,S,x,y;

void Read()
{
    scanf("%d%d%d",&N,&M,&S);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&x,&y);
        Graf[x].push_back(y);
    }
    memset(d,-1,sizeof(d));
}

void BFS()
{
    Q.push(S);
    d[S]=0;
    while(Q.empty()==false)
    {
        int nod=Q.front();
        Q.pop();
        for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
            if(d[*it]==-1)
            {
                d[*it]=d[nod]+1;
                Q.push(*it);
            }
    }
}

void Write()
{
    for(int i=1;i<=N;i++)
        printf("%d ",d[i]);
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    Read();
    BFS();
    Write();
}