#include <iostream>
#include <vector>
#include <fstream>
#include <cstring>
#include <queue>

#define N 100010

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,l,s,el,i,j,k;
vector<int> A[N];
queue<int> coada;
int G[N],Cost[N];

void BFS(int x)
{
    coada.push(x);
    memset(Cost,-1,sizeof(Cost));
    Cost[x]=0;
    while(!coada.empty())
    {
        el=coada.front();
        coada.pop();
        for(i=0;i<G[el];i++)
        {
            if(Cost[A[el][i]]==-1)
            {
                coada.push(A[el][i]);
                Cost[A[el][i]]=Cost[el]+1;
            }
        }
    }
}
int main()
{
    int x,y;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        A[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        G[i]=A[i].size();
    BFS(s);
    for(i=1;i<=n;i++)
        g<<Cost[i]<<" ";
}